---

IndexList.java

gehe zur Dokumentation dieser Datei

/*
 * $Source: /shared/cvsroot/diplom/app/src/java/de/picana/clusterer/IndexList.java,v $
 * $Author: mstolpe $
 * $Date: 2003/04/22 09:51:27 $
 * $Revision: 1.5 $
 * $Release$
 *
 * Created on 21. November 2002, 14:05
 *
 * Copyright 2002 by Marco Stolpe
 */

package de.picana.clusterer;

import java.util.*;


public class IndexList {
    
    private List orig_list;
    private ArrayList[] ref_list;
    private ArrayList[] iter_list;
    private int dim;
    private int size;
    private int[] index_first;
    private int[] index_last;
    
    
    public class Node {
        public int index;
        public int previous;
        public int next;
        
        public Node(int index, int previous, int next) {
            this.index = index;
            this.previous = previous;
            this.next = next;
        }
    }
    
    
    class IndexComparator implements Comparator {
     
        private int component;
        
        public IndexComparator(int component) {
            this.component = component;
        }
        
        public int compare(Object o1, Object o2) {
            Node n1 = (Node)o1;
            Node n2 = (Node)o2;
            MLVector vec1 = (MLVector)orig_list.get(n1.index);
            MLVector vec2 = (MLVector)orig_list.get(n2.index);
            if (vec1.value[component] > vec2.value[component])
                return 1;
            if (vec1.value[component] < vec2.value[component])
                return -1;
            return 0; 
        }
    }

    
    public IndexList(List list) {
        orig_list = list;
        MLVector vec = (MLVector)orig_list.get(0);
        size = orig_list.size();
        dim = vec.dim;
        
        ref_list = new ArrayList[dim];
        iter_list = new ArrayList[dim];
        index_first = new int[dim];
        index_last = new int[dim];
        
        Node n;
        int i, j;
        
        for (i=0; i < dim; i++) {
            
            ref_list[i] = new ArrayList();
            iter_list[i] = new ArrayList();
            
            for (j=0; j < size; j++)
                ref_list[i].add(new Node(j, -1, -1));
            
            Collections.sort(ref_list[i], new IndexComparator(i));
            
            for (j=0; j < size; j++) {
               n = (Node)ref_list[i].get(j);
               n.previous = j-1;
               n.next = (j < size-1) ? j+1 : -1;
            }
            
            index_first[i] = 0;
            index_last[i] = size-1;
        }
    }
    
    public int getFirst(int component) {
        Node n = (Node)ref_list[component].get(index_first[component]);
        return n.index;
    }
    
    public int getLast(int component) {
        Node n = (Node)ref_list[component].get(index_last[component]);
        return n.index;
    }
    
    public IndexListIterator iterator(int component) {
        IndexListIterator iter = new IndexListIterator(
            ref_list[component], iter_list[component],
            index_first, index_last, -1, component, false);
        iter_list[component].add(iter);
        return iter;
    }
    
    public IndexListIterator iteratorReverse(int component) {
        IndexListIterator iter = new IndexListIterator(
            ref_list[component], iter_list[component],
            index_first, index_last, -1, component, true);
        iter_list[component].add(iter);
        return iter;
    }
    
    public void freeIterator(int component, IndexListIterator iter) {
        iter_list[component].remove(iter);    
    }
}

---