package c.i.a.c;

import c.i.a.c.r1;
/* compiled from: BasePlayer */
public abstract class f0 implements g1 {
    public final r1.c a = new r1.c();

    @Override // c.i.a.c.g1
    public final boolean hasNext() {
        return y() != -1;
    }

    @Override // c.i.a.c.g1
    public final boolean hasPrevious() {
        return t() != -1;
    }

    @Override // c.i.a.c.g1
    public final boolean k() {
        r1 D = D();
        return !D.q() && D.n(o(), this.a).j;
    }

    @Override // c.i.a.c.g1
    public final int t() {
        r1 D = D();
        if (D.q()) {
            return -1;
        }
        int o = o();
        int B = B();
        if (B == 1) {
            B = 0;
        }
        return D.l(o, B, F());
    }

    @Override // c.i.a.c.g1
    public final boolean v() {
        return u() == 3 && g() && z() == 0;
    }

    @Override // c.i.a.c.g1
    public final int y() {
        r1 D = D();
        if (D.q()) {
            return -1;
        }
        int o = o();
        int B = B();
        if (B == 1) {
            B = 0;
        }
        return D.e(o, B, F());
    }
}