o.java

哈利波特与凤凰令的一个小游戏

        a(super.a.a + a(), i1);
        if(aa.a(1))
        {
            t--;
            if(t < 0)
                t = a.c - 1;
            aa.b(1);
        }
        if(aa.a(2))
        {
            t++;
            if(t >= a.c)
                t = 0;
            aa.b(2);
        }
        if(aa.a(16))
        {
            aa.a.e();
            aa.b(16);
        }
        aa.a.q -= i1;
        if(aa.a.q < 0)
            aa.a.q += 550;
        a.a(i1);
    }

    public final void c()
    {
        super.j = 18;
    }

    public final void d()
    {
        super.j = 14;
        a = a();
        n = 0;
        o = 8;
        C = aa.b(t * 4, (t + 1) * 4 - 1);
        if(C > a.i - 1)
            C = a.i - 1;
        k k1;
        if(aa.b && aa.e != -1)
            k1 = aa.a(aa.e);
        else
            k1 = aa.a(a.a[C]);
        int i1 = aa.b(0, k1.a - 1);
        int j1;
        if((j1 = aa.b(0, 1)) == 0)
            j1 = -1;
        a.a(k1, -1, i1, j1);
        a.r = k1.b + ((k1.c - k1.b) * ((z) (a)).a.b) / 12;
        h = 0;
        u = 0;
        aa.a.b[8] += k1.a;
        aa.a.b[9]++;
    }

    private void s(int i1)
    {
        a(super.a.a + a(), i1);
        if(aa.a.l == 0)
        {
            super.j = 16;
            aa.a.c(0);
        }
    }

    public final void c(int i1)
    {
        a(super.a.a + a(), i1);
    }

    private void t(int i1)
    {
        a(super.a.a + a(), i1);
        aa.b(15);
        int j1;
        if((j1 = a.a()) == 1)
        {
            n += a.n;
            if(a.n == 1)
            {
                aa.a.c(2);
                aa.c(1);
            } else
            if(a.n == 2)
            {
                aa.a.c(3);
                aa.c(1);
            }
            if(a.n == 1)
                a.b(0);
            else
            if(a.n == 2)
                a.b(1);
            if(n >= o)
            {
                n = 0;
                a = a;
                super.j = 2;
                aa.a.a.b();
            }
        } else
        if(j1 == -1)
        {
            n--;
            if(n < 0)
                n = 0;
            if(h > n)
                h = (byte)n;
            aa.b();
            a.b(2);
            aa.a.c(4);
        } else
        if(a.f == 0 && a.f != a.g && a.p == 0)
            a.b(3);
        if(h < n)
        {
            u += i1;
            if(u >= 300)
            {
                h++;
                u = 0;
                int k1 = 146;
                for(int l1 = 0; l1 < h - 1; l1++)
                    k1 += aa.a[9].a[26] + 2;

                aa.a.a.a(k1 - 4, 16, 5, 12, 700, 4, 10);
            }
        }
    }

    private void u(int i1)
    {
        a(super.a.j, i1);
        if(c())
            aa.a.f();
    }

    private void v(int i1)
    {
        a_ = a(((q) (a)).o - super.o, ((q) (a)).p - super.p);
        a(super.a.a + a(), i1);
        int j1;
        if(a.c)
            if((j1 = a.a()) == 1)
                a.d();
            else
            if(j1 == -1)
                a.e();
        if(a.a)
            aa.a.g();
    }

    public final void a(t t1)
    {
        switch(super.a.b)
        {
        case 2: // '\002'
            t1.a = (short)(super.o - 14);
            t1.b = (short)(super.p - 56);
            t1.c = (short)(super.o + 10);
            t1.d = (short)(super.p + 9);
            return;
        }
        t1.a = (short)(super.o - 10);
        t1.b = (short)(super.p - 40);
        t1.c = (short)(super.o + 10);
        t1.d = (short)(super.p + 4);
    }

    private boolean f()
    {
        b = null;
        int i1 = 0xf423f;
        z z1 = null;
        boolean flag = false;
        z az[] = ai.a[3];
        for(int l1 = 0; l1 < 16; l1++)
        {
            int j1;
            z z2;
            if((z2 = az[l1]).i && z2.E == 1 && (j1 = q.a(q.a(((q) (z2)).o - super.o), q.a(((q) (z2)).p - super.p))) <= 24 && j1 < i1)
            {
                i1 = j1;
                z1 = z2;
            }
        }

        az = ai.a[3];
        for(int i2 = 0; i2 < 16; i2++)
        {
            int k1;
            z z3;
            if((z3 = az[i2]).i && z3.E == 1 && (k1 = q.a(q.a(((q) (z3)).o - super.o), q.a(((q) (z3)).p - super.p))) <= 24 && k1 < i1)
            {
                i1 = k1;
                z1 = z3;
            }
        }

        if(z1 != null)
        {
            b = z1;
            return true;
        } else
        {
            return false;
        }
    }

    private boolean g()
    {
        switch(c)
        {
        case 67: // 'C'
            if(f > 0)
            {
                super.j = 26;
                return true;
            } else
            {
                return false;
            }
        }
        return false;
    }

    private static int c(int i1)
    {
        char c1 = '\0';
        switch(i1)
        {
        case 2: // '\002'
            c1 = '\207';
            break;

        case 3: // '\003'
            c1 = '\u013B';
            break;

        case 0: // '\0'
            c1 = '\024';
            break;

        case 1: // '\001'
            c1 = '\310';
            break;
        }
        return c1;
    }

    public final int a()
    {
        switch(super.a.b)
        {
        case 2: // '\002'
            return 0;
        }
        return super.a();
    }

    private boolean h()
    {
        x ax[] = (x[])ai.a;
        int i1 = aa.a.e;
        int j1 = 0xf423f;
        a = null;
        x x1 = null;
        byte byte0 = 0;
        byte byte1 = 0;
        switch(a_)
        {
        case 2: // '\002'
            byte0 = -46;
            byte1 = -46;
            break;

        case 3: // '\003'
            byte0 = 45;
            byte1 = 45;
            break;

        case 0: // '\0'
            byte0 = 61;
            byte1 = -21;
            break;

        case 1: // '\001'
            byte0 = -61;
            byte1 = 21;
            break;
        }
        g g1 = aa.a[1];
        for(int k1 = 0; k1 < i1; k1++)
        {
            x x2;
            if(!(x2 = ax[k1]).b || x2.a == 0 || !x2.a())
                continue;
            int l1 = (((q) (x2)).o + (g1.a[x2.a] >> 1)) - super.o;
            int i2 = (((q) (x2)).p + (g1.b[x2.a] >> 1)) - super.p;
            int j2;
            if((j2 = q.a(q.a(l1), q.a(i2))) <= super.a.m && j2 < j1 && byte0 * l1 + byte1 * i2 >= 0)
            {
                j1 = j2;
                x1 = x2;
            }
        }

        if(x1 != null)
        {
            a = x1;
            return true;
        } else
        {
            return false;
        }
    }

    private void w(int i1)
    {
        a(super.a.c + a(), i1);
        if(c())
        {
            if(r == 0)
            {
                r = 7;
                a = 9;
                f = a.a;
                return;
            }
            int j1;
            if((j1 = i1 * 384 >> 10) > 384)
                j1 = 384;
            boolean flag = false;
            if(f != 0)
            {
                int k1;
                if((k1 = f - j1) < 0)
                    k1 = 0;
                f = (short)k1;
                if(a.a != 0 && k1 < 150)
                {
                    a.a = 0;
                    a.a = 0;
                    a.j = 1;
                    ai.b = true;
                    p p1;
                    if((p1 = (p)ai.a(64)) != null)
                    {
                        g g1 = aa.a[1];
                        p1.a((short)(((q) (a)).o + g1.a[a.a]), (short)(((q) (a)).p + g1.b[a.a]), this, null, aa.a((byte)9), (short)-1, (short)-1);
                    }
                }
                if(k1 > 80 && r < 12)
                    r++;
                else
                if(r > 2 && k1 < 80)
                    r--;
                flag = true;
            }
            if(((q) (a)).d != null && a.a == 0)
            {
                for(int l1 = 0; l1 < ((q) (a)).d.length; l1++)
                {
                    int i2 = ((q) (a)).d[l1] & 0xfff;
                    int j2;
                    Object obj;
                    if((j2 = (((q) (a)).d[l1] & 0xffff) >> 12) == 2 && ((x) (obj = (x)aa.a.a[2][i2])).a != 0)
                    {
                        obj.a = 0;
                        flag = true;
                        obj.a = 0;
                        obj.j = 1;
                    }
                    if(j2 == 4 && ((q) (obj = (ah)aa.a.a[4][i2])).j == 0)
                        obj.j = 3;
                }

            }
            if(!flag)
            {
                super.j = 0;
                a = null;
            }
        }
    }

    public final void e()
    {
        if(super.j != 25 && super.j != 29)
            super.j = 0;
        d(super.a.a + a());
        i = 0;
        j = 0;
    }

    private void x(int i1)
    {
        if(a.a(i1, a, b))
            super.j = 25;
    }

    private void y(int i1)
    {
        e e1 = aa.a.a;
        int j1 = super.o + e1.i << 6;
        int k1 = super.p - (e1.j >> 1) << 6;
        if(a.a(i1, j1, k1) || !a.a(e1))
            super.j = 0;
    }

    private void k()
    {
        e e1 = aa.a.a;
        super.j = 0;
        aa.a.a.a(this, true);
        aa.a.b();
        if(f)
            a(true, e1.a - 70, e1.b + e1.j + 70);
    }

    private void z(int i1)
    {
        a.a = false;
        int j1;
        if((j1 = aa.a.a(((q) (a)).o, ((q) (a)).p)) > 7)
        {
            a.a = true;
        } else
        {
            a.p += 56;
            int k1 = aa.a.a(((q) (a)).o, ((q) (a)).p);
            a.p -= 56;
            if(k1 > 7)
                a.a = true;
        }
        if(!f && aa.a(16384))
        {
            aa.b(16384);
            l();
            return;
        }
        char c1 = '\uFFFF';
        if(aa.a(4))
            c1 = '\310';
        else
        if(aa.a(8))
            c1 = '\024';
        else
        if(aa.a(1))
            c1 = '\207';
        else
        if(aa.a(2))
            c1 = '\u013B';
        if(c1 == '\uFFFF')
        {
            a_ = z.a((short)(((q) (a)).o - super.o), (short)((((q) (a)).p + 56) - super.p));
            a(super.a.a + a(), i1);
            a.b(i1);
            return;
        } else
        {
            int l1 = 0;
            l1 = aa.a(c1, 0);
            a.a(i1, aa.a(l1), aa.b(l1), true);
            a_ = z.a((short)(((q) (a)).o - super.o), (short)((((q) (a)).p + 56) - super.p));
            a(super.a.a + a(), i1);
            return;
        }
    }

    private void A(int i1)
    {
        if(b != null)
        {
            switch(((q) (b)).i)
            {
            case 67: // 'C'
                f++;
                break;
            }
            b.i = false;
            a = null;
            b = null;
        }
        a(super.a.h, i1);
        if(c())
            super.j = 0;
    }

    private void B(int i1)
    {
        a(super.a.g, i1);
        if(c())
        {
            z z1;
            if((z1 = ai.a(c)) != null)
            {
                if(a_ == 1)
                    z1.o = (short)(super.o - 5);
                else
                    z1.o = (short)(super.o + 5);
                z1.p = super.p;
                z1.E = 1;
                switch(c)
                {
                default:
                    break;

                case 67: // 'C'
                    if(f > 0)
                        f--;
                    break;
                }
            }
            super.j = 0;
        }
    }

    private void l()
    {
        super.j = 0;
        aa.a.a.a(this, true);
        a.o = 0;
        a.a = 0;
        a.p = 0;
        a.b = 0;
        f = false;
    }

    public final void f()
    {
        switch(super.a.b)
        {
        default:
            break;

        case 0: // '\0'
        case 1: // '\001'
            switch(a_)
            {
            case 2: // '\002'
                p = 9;
                q = -31;
                break;

            case 3: // '\003'
                p = 8;
                q = -20;
                break;

            case 0: // '\0'
                p = 24;
                q = -27;
                break;

            case 1: // '\001'
                p = -24;
                q = -27;
                // fall through

            default:
                return;
            }
            break;

        case 2: // '\002'
            switch(a_)
            {
            case 2: // '\002'
                p = -30;
                q = -36;
                return;

            case 3: // '\003'
                p = -30;
                q = -36;
                return;

            case 0: // '\0'
                p = -30;
                q = -36;
                return;

            case 1: // '\001'
                p = 30;
                q = -36;
                break;
            }
            break;
        }
    }
}