/*
 * Decompiled with CFR 0.152.
 */
import java.io.DataInput;
import java.io.DataOutput;
import java.util.Vector;

public final class jv
extends mg {
    private final ck f;
    private Vector c;
    private Vector d;
    private boolean e;
    public boolean a;

    public final boolean y_() {
        return true;
    }

    public final boolean z_() {
        return this.a;
    }

    public jv(ck ck2) {
        super(ck.a(ck2));
        this.f = ck2;
        this.c = new Vector();
        this.d = new Vector();
        this.a = true;
        this.e = false;
    }

    public final void a(int n) {
        this.f.a(n);
    }

    public final boolean a(int n, ke ke2, byte[] byArray) {
        block5: {
            block4: {
                dx dx2 = (dx)this.c.elementAt(n);
                if (dx2 == null) break block4;
                if (!dx2.e.equals(ke2)) break block5;
                dx2.a(byArray);
                dx2.b -= (long)n;
                if (ck.c(this.f) != null) {
                    ck.c(this.f).w();
                }
            }
            return false;
        }
        return true;
    }

    public final boolean a(DataInput dataInput) {
        super.a(dataInput);
        return this.c.size() == 0;
    }

    public static int a(int[] nArray, int n, int n2) {
        int n3 = n + n2;
        n2 = 0;
        while (n < n3) {
            n2 += nArray[n];
            ++n;
        }
        return n2;
    }

    public static void a(int[] nArray, int n, int n2, int n3) {
        n3 = n2 + n3;
        while (n2 < n3) {
            nArray[n2] = n;
            ++n2;
        }
    }

    public static int a(Object[] objectArray, Object object) {
        for (int i = 0; i < objectArray.length; ++i) {
            Object object2 = objectArray[i];
            boolean bl2 = object == null ? object2 == null : object.equals(object2);
            if (!bl2) {
                continue;
            }
            return i;
        }
        return -1;
    }

    public final synchronized void a(dx dx2, int n) {
        if (!this.e) {
            if (this.c.indexOf(dx2) == -1) {
                int n2;
                for (n2 = this.c.size(); n2 > 0; --n2) {
                    if (n < (Integer)this.d.elementAt(n2 - 1)) {
                        continue;
                    }
                    this.c.insertElementAt(dx2, n2);
                    this.d.insertElementAt(new Integer(n), n2);
                    break;
                }
                if (n2 == 0) {
                    this.c.insertElementAt(dx2, 0);
                    this.d.insertElementAt(new Integer(n), 0);
                }
            }
            return;
        }
        throw new RuntimeException("Adding tiles to closed request!");
    }

    public final void b(int n) {
        Vector vector = new Vector();
        Vector vector2 = this.c;
        synchronized (vector) {
            for (int i = n; i < vector2.size(); ++i) {
                vector.insertElementAt(vector2.elementAt(i), i - n);
            }
        }
        this.c = vector;
        ck.b(this.f).clear();
    }

    public final void a(DataOutput dataOutput) {
        synchronized (this) {
            this.e = true;
        }
        this.d = null;
        ke[] keArray = new ke[this.c.size()];
        for (int i = 0; i < this.c.size(); ++i) {
            keArray[i] = ((dx)this.c.elementAt((int)i)).e;
        }
        this.a(keArray, dataOutput);
    }
}