---

IndexListIterator.java

gehe zur Dokumentation dieser Datei

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

package de.picana.clusterer;

import java.util.*;


public class IndexListIterator {
    
    private ArrayList ref_list;
    private ArrayList iter_list;
    private int[] index_first;
    private int[] index_last;
    private int index;
    private int component;
    private boolean reverse;
    
    public IndexListIterator(ArrayList ref_list, ArrayList ptr_list,
                             int[] index_first, int[] index_last,
                             int index, int component, boolean reverse) {
        
        this.ref_list = ref_list;       // Zeiger auf Referenz-Liste
        this.iter_list = ptr_list;      // Zeiger auf Iterator-Liste
        this.index_first = index_first; // Erster Index der Liste (am Anfang 0)
        this.index_last = index_last;   // Letzter Index der Liste (am Anfang size-1)
        this.index = index;             // Vorinitialisierung mit -1
        this.component = component;     // ?ber welche Komponente wird iteriert?
        this.reverse = reverse;         // Nach vorne oder zur?ck?
    }
     
    public boolean hasPrevious() {
        if (reverse == false) // gilt nur f?r Richtung "zur?ck"
            return false;
        
        if ((index == -1) && (index_last[component] != -1))
            return true;
        else if (index == -2)
            return false;
        else {
            IndexList.Node n = (IndexList.Node)ref_list.get(index);
            if (n.previous != -1)
                return true;
        }
        return false;
    }
    
    public int previous() {
        if (reverse == false)
            return -1;
        
        IndexList.Node n;
        if (index == -1)
            index = index_last[component];
        else {
            n = (IndexList.Node)ref_list.get(index);
            index = n.previous;
        }
         
        n = (IndexList.Node)ref_list.get(index);
        return n.index;
    }
    
    public int previousIndex() {
        if (reverse == false)
            return -1;
        
        if (index == -1)
            return index_last[component];
        
        return index;
    }
    
    public boolean hasNext() {
        if (reverse == true)
            return false;
        
        if ((index == -1) && (index_first[component] != -1))
            return true;
        else if (index == -2)
            return false;
        else {
            IndexList.Node n = (IndexList.Node)ref_list.get(index);
            if (n.next != -1)
                return true;
        }
        return false;
    }
    
    public int next() {
        if (reverse == true)
            return -1;
        
        IndexList.Node n;
        if (index == -1)
            index = index_first[component];
        else {
            n = (IndexList.Node)ref_list.get(index);
            index = n.next;
        }
         
        n = (IndexList.Node)ref_list.get(index);
        return n.index;
    }
    
    public int nextIndex() {
        if (reverse == true)
            return -1;
        
        if (index == -1)
            return index_first[component];
        
        return index;
    }
    
    public void remove() {
        
        if (index != -1) {
            
            IndexList.Node n_prev = null;
            IndexList.Node n_next = null;
            IndexList.Node n = (IndexList.Node)ref_list.get(index);
            
            //System.out.println("vor dem L?schen:");
            //System.out.println("index: " + index);
            //System.out.println("n.previous: " + n.previous);
            //System.out.println("n.next: " + n.next);
            
            // remove element from ref_list by updating
            // the links of previous and next element
            
            if (n.previous != -1) {
                n_prev = (IndexList.Node)ref_list.get(n.previous);
                //System.out.println("n.previous.next: " + n_prev.next);
                n_prev.next = n.next;
            } else {
                //System.out.println(index);
                index_first[component] = n.next;
            }
            
            if (n.next != -1) {
                n_next = (IndexList.Node)ref_list.get(n.next);
                //System.out.println("n.next.previous: " + n_next.previous);
                n_next.previous = n.previous;
            } else {
                //System.out.println(index);
                index_last[component] = n.previous;
            }
            
            //System.out.println("nach dem L?schen:");
            //
            //if (n_prev != null)
            //    System.out.println("n.previous.next: " + n_prev.next);
            //else
            //    System.out.println("index_first[c]: " + n.next);
            //
            //if (n_next != null)
            //    System.out.println("n.next.previous: " + n_next.previous);
            //else
            //    System.out.println("index_last[c]: " + n.previous);
            
            
            
            // update index for all iterators of this component
            
            int i;
            int temp_index = index;
            
            for (i=0; i < iter_list.size(); i++) {
                IndexListIterator iter = (IndexListIterator)iter_list.get(i);
                if (iter.index() == temp_index) {
                    if (iter.reverse() == false) {
                        //System.out.println("(" + i + ", " + iter.reverse() + ") index: " + n.next);
                        if (n.previous != -1) 
                            iter.setIndex(n.previous);
                    } else {
                        //System.out.println("(" + i + ", " + iter.reverse() + ") index: " + n.previous);
                        if (n.next != -1)
                            iter.setIndex(n.next);
                    }
                }
            }  
        }
    }
    
    public int index() {
        return index;    
    }
    
    public void setIndex(int i) {
        this.index = i;    
    }
    
    public boolean reverse() {
        return this.reverse;    
    }
}

---