sortedset.java

用于multivariate时间序列分类

/**
  * This is a sorted set of ints. 
  *
  * 
  * @author Waleed Kadous
  * @version $Id: SortedSet.java,v 1.1.1.1 2002/06/28 07:36:16 waleed Exp $
  */
      
package tclass.clusteralg;   
import tclass.*; 
import tclass.util.*; 
import java.util.*; 

public class SortedSet {
    // Hmmm .... vectors or arrays? Go for arrays ...
    Vector data; 
    public SortedSet(){
        data = new Vector(); 
    }

    public void add(int s){
        insertOrd(s); 
    }
    public void add(int[] ss){
        for(int i =0 ; i < ss.length; i++){
            insertOrd(ss[i]); 
        }
    }
    boolean insertOrd(int s){
        int currentSize = size(); 
        if(currentSize == 0){
            data.addElement(new Integer(s)); 
            return true; 
        }
        for(int i=0; i < currentSize; i++){
            int currentInt= ((Integer) data.elementAt(i)).intValue(); 
            if(currentInt == s){
                return true; 
            }
            if(s < currentInt){
                data.insertElementAt(new Integer(s),i); 
                return true; 
            }
        }
        // if we're still here ...
        data.addElement(new Integer(s)); 
        return true; 
    }
    
    public int size(){
        return data.size(); 
    }
    
    int[] randomSubset(int numEls){
        // If numEls > size, return whole thing. 
        int currentSize = size(); 
        if(numEls >= currentSize){
            int[] retval = new int[currentSize]; 
            for(int i=0; i < retval.length; i++){
                retval[i] = elAt(i); 
            }
            return retval; 
        }
        else {
            int[] retval = new int[numEls]; 
            int currentChoiceIndex;
            for(int i=0; i < retval.length; i++){
                currentChoiceIndex = (int) (Math.random()*currentSize);
                while(foundIn(elAt(currentChoiceIndex), retval, i)){
                    currentChoiceIndex = (int) (Math.random()*currentSize);
                }
                retval[i] = elAt(currentChoiceIndex); 
            }
            return retval; 
        }
    }

    public int elAt(int n){
        return ((Integer) data.elementAt(n)).intValue(); 
    }
     boolean foundIn(int point, int[] points, int maxIndex){
        for(int i=0; i < maxIndex; i++){
            if(points[i] == point){
                return true; 
            }
        }
        return false; 
    }
    public String toString(){
        StringBuffer retval = new StringBuffer(); 
        int currentSize = size(); 
        for(int i = 0; i < currentSize; i++){
            retval.append("Rank " + i + ": " + data.elementAt(i) + "\n"); 
        }
        return retval.toString(); 
          
    }
    
    String printArr(int[] array){
        StringBuffer retval = new StringBuffer("[ "); 
        for(int i=0; i < array.length; i++){
            retval.append(array[i] + " "); 
        }
        retval.append("]"); 
        return retval.toString(); 
    }
    
    public static void main(String[] args){
        int maxSize = 10; 
        int numInserts = 100; 
        SortedSet ss = new SortedSet(); 
        int randValue; 
        for(int i=0; i < numInserts; i++){
            randValue = (int) (Math.random()*20); 
            ss.add(randValue); 
            System.out.println("Inserted " + i + " with value " + randValue); 
        }
        System.out.println("Top results are: "); 
        System.out.println(ss.toString()); 
        for(int i=0; i < 10;i ++){
            System.out.println("Random subset is: " + ss.printArr(ss.randomSubset(i))); 
        }
    }

}