Algorithmen und Datenstrukturen Übung 4 Aufgabe 2

Feld.java

/**
 * Created by Nils on 28.04.2015.
 */
public class Feld<T> {
    private T[] feld;

    public Feld(int anzahl) {
        @SuppressWarnings("unchecked")
        T[] f = (T[])new Object[anzahl];
        feld = f;
    }

    public int size() {
        return feld.length;
    }

    public T get(int i) {
        return feld[i];
    }

    public T set(int i, T e) {
        T result = feld[i];
        feld[i] = e;
        return result;
    }
}

Paar.java

/**
 * Created by Nils on 28.04.2015.
 */
public class Paar<T> {
    private T first, second;

    public Paar(T f, T s) {
        this.first = f;
        this.second = s;
    }

    public void swap() {
        T tmp;
        tmp = this.first;
        this.first = this.second;
        this.second = tmp;
    }

    public T first() {
        return this.first;
    }

    public T second() {
        return this.second;
    }

    public String toString() {
        return "(" + this.first() + "," + this.second() + ")";
    }

}

PaarFeld.java

/**
 * Created by Nils on 28.04.2015.
 */
@SuppressWarnings("unchecked")
public class PaarFeld<T> {
    private Feld<T> a, b;
    private int length;

    public PaarFeld(Feld<T> a, Feld<T> b) {
        this.length = (a.size() < b.size()) ? a.size() : b.size();
        this.a = a;
        this.b = b;
    }

    public Paar<T> get(int i) throws ArrayIndexOutOfBoundsException {
        if(i < length) {
            return new Paar<T>(a.get(i), b.get(i));
        } else {
            throw new ArrayIndexOutOfBoundsException();
        }
    }

    public Paar<T> set(int i, Paar<T> a) {
        return new Paar<T>(this.a.set(i, a.first()), this.b.set(i, a.second()));
    }

    public int size() {
        return this.length;
    }
}