o.java

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

        if(!c)
            return;
        int l1 = 0xf423f;
        switch(aa.a.p)
        {
        default:
            break;

        case 0: // '\0'
        case 5: // '\005'
            for(int i1 = 0; i1 < k1; i1++)
            {
                h h1;
                if(aq[i1].i == 1 && ((z) (h1 = (h)aq[i1])).E > 0 && ((q) (h1)).j != 17 && ((q) (h1)).j != 20 && ((q) (h1)).j != 21 && ((q) (h1)).j != 22 && ((q) (h1)).j != 1 && (((z) (h1)).a.b == 2 || ((z) (h1)).a.b == 3 || ((z) (h1)).a.b == 4 || ((z) (h1)).a.b == 12 || ((z) (h1)).a.b == 20 || ((z) (h1)).a.b == 21) && h1.c)
                {
                    int i2 = ((q) (h1)).o - super.o;
                    int k2 = ((q) (h1)).p - super.p;
                    int l2;
                    if((l2 = i2 * i2 + k2 * k2) < l1)
                    {
                        if(aa.a.a(super.o, super.p, ((q) (h1)).o, ((q) (h1)).p, (byte)0))
                            if((((q) (h1)).j == 19 || ((q) (h1)).j == 5) && a == null)
                            {
                                a = h1;
                            } else
                            {
                                a = h1;
                                l1 = l2;
                            }
                        a = a();
                    }
                }
            }

            break;

        case 2: // '\002'
            a = null;
            for(int j1 = 0; j1 < k1; j1++)
            {
                h h2;
                int j2;
                if(aq[j1].i == 1 && ((q) (h2 = (h)aq[j1])).j != 1 && h2.c && (j2 = (((q) (h2)).o - super.o) * (((q) (h2)).o - super.o) + (((q) (h2)).p - super.p) * (((q) (h2)).p - super.p)) < l1)
                {
                    a = h2;
                    l1 = j2;
                }
            }

            if(a != null && ((q) (a)).j != 8 && ((q) (a)).j != 9 && ((q) (a)).j != 10 && ((h)a).c)
                c = 67;
            break;
        }
    }

    public final void a(short word0)
    {
        if(aa.a)
            return;
        E -= word0;
        if(aa.a.p == 2)
        {
            E = 0;
            aa.a.b[4]++;
        } else
        if(aa.a.p == 1 || aa.a.p == 0 || aa.a.p == 5)
        {
            aa.a.b[2] += word0;
            if(E < 0)
                aa.a.b[2] += E;
        }
        if(E <= 0)
            E = 0;
        if(super.j == 21 || super.j == 17)
            return;
        if(aa.a.p == 1)
        {
            if(super.j == 18 || super.j == 36)
            {
                super.j = 21;
                return;
            }
            super.j = 17;
        }
    }

    public final boolean a()
    {
        if(super.j == 15)
            return true;
        return super.j == 3 && g + 400 > 720;
    }

    private void h(int i1)
    {
        if(aa.a.p != 1 && (aa.a(4) || aa.a(8) || aa.a(1) || aa.a(2)) && (a == null || ((q) (a)).i != 13))
        {
            super.j = 0;
            return;
        }
        if(aa.a.p != 1)
            a_ = a(((q) (a)).o - super.o, ((q) (a)).p - super.p);
        a(super.a.c + a(), i1);
        if(aa.a.p == 1)
        {
            g += i1;
            if(g < 720)
            {
                r = g / 60;
                return;
            }
        } else
        {
            g += i1;
            if(r < 12)
                r++;
            if(g <= aa.a[a].b)
                return;
        }
        super.j = 4;
        g = 0;
        if(aa.a(a).a != 1 && a != null && (((q) (a)).i != 1 || a.E > 0))
            b(i1);
    }

    private void j()
    {
        if(((h)a).a)
            return;
        short word0 = aa.a.c[13];
        int i1 = 0;
        do
        {
            if(i1 >= word0)
                break;
            b b1;
            if((b1 = (b)aa.a.a[13][i1]).a())
                switch(((q) (b1)).j)
                {
                case 0: // '\0'
                case 1: // '\001'
                case 2: // '\002'
                case 3: // '\003'
                    a = b1;
                    return;

                case 4: // '\004'
                case 5: // '\005'
                    return;
                }
            i1++;
        } while(true);
    }

    public final void b(int i1)
    {
        if(a == null)
            return;
        aj aj1 = aa.a(a);
        Object obj = null;
        switch(aj1.a)
        {
        case 1: // '\001'
            p p1;
            if((p1 = (p)ai.a(64)) != null)
                p1.a(((q) (a)).o, (short)(((q) (a)).p - aa.a.a.j), a, this, aj1, (short)-1, (short)-1);
            if((p1 = (p)ai.a(64)) != null)
                p1.a((short)(((q) (a)).o - 3), (short)(((q) (a)).p - aa.a.a.j - 60), a, this, aj1, (short)-1, (short)-1);
            if((p1 = (p)ai.a(64)) != null)
            {
                p1.a((short)(((q) (a)).o + 3), (short)(((q) (a)).p - aa.a.a.j - 100), a, this, aj1, (short)-1, (short)-1);
                return;
            }
            break;

        case 9: // '\t'
            p p2;
            if((p2 = (p)ai.a(64)) != null)
            {
                p2.a((short)(super.o + p), (short)(super.p + q), a, this, aj1, (short)-1, (short)-1);
                return;
            }
            break;

        default:
            p p3;
            if((p3 = (p)ai.a(64)) == null)
                break;
            if(a != null && (a instanceof n))
            {
                a.o += ((n)a).c;
                a.p += ((n)a).d;
                if(((z) ((n)a)).a.b == 11)
                    a.p += 10;
                p3.a((short)(super.o + p), (short)(super.p + q), a, this, aa.a(a), (short)-1, (short)-1);
                a.o -= ((n)a).c;
                a.p -= ((n)a).d;
                if(((z) ((n)a)).a.b == 11)
                    a.p -= 10;
                a(super.a.c + a(), i1);
                super.j = 15;
                return;
            }
            t t1 = new t();
            a.a(t1);
            p3.a((short)(super.o + p), (short)(super.p + q), a, this, aj1, (short)(t1.a + t1.c >> 1), (short)(t1.b + t1.d >> 1));
            break;
        }
    }

    private void i(int i1)
    {
        if(aa.a(4) || aa.a(8) || aa.a(1) || aa.a(2))
        {
            super.j = 0;
            return;
        }
        if(aa.a.p != 1)
            a_ = a(((q) (a)).o - super.o, ((q) (a)).p - super.p);
        a(super.a.c + a(), i1);
        g += i1;
        if(g > 128)
            super.j = 0;
    }

    private void j(int i1)
    {
        if(aa.a.p != 1 && (aa.a(4) || aa.a(8) || aa.a(1) || aa.a(2)) && (a == null || ((q) (a)).i != 13))
        {
            super.j = 0;
            return;
        }
        if(aa.a.p != 1)
            a_ = a(((q) (a)).o - super.o, ((q) (a)).p - super.p);
        a(super.a.c + a(), i1);
        if(c())
        {
            if(aa.a.p == 1)
                r = 0;
            else
                r = 7;
            if(a.a.b == 21)
                j();
            if(a == null || ((q) (a)).i == 13 && ((q) (a)).j != 0)
            {
                super.j = 0;
                return;
            }
            super.j = 3;
            if(((q) (a)).i == 13)
                a.j = 1;
            g = 0;
            a = a();
            if(a == 1)
                if(((q) (a)).i == 13)
                {
                    a = 5;
                } else
                {
                    r = 0;
                    b(i1);
                }
            if(aa.a.p == 1)
            {
                t t1 = new t();
                b(t1);
            }
        }
    }

    public final void b(e e1)
    {
        if(b)
        {
            g g1;
            (g1 = aa.a[3]).a(0, super.o - (g1.a[0] >> 1), super.p, 0, e1, 0);
            g1.a(0, super.o - (g1.a[0] >> 1), super.p + (g1.b[0] >> 1), 0, e1, 0);
            g1.a(0, super.o, super.p, 0, e1, 0);
            g1.a(0, super.o, super.p + (g1.b[0] >> 1), 0, e1, 0);
            return;
        }
        super.b(e1);
        if(aa.a.p != 2)
            return;
        if(a && c)
        {
            if(aa.b() && aa.ac == super.a.b)
                return;
            g g2 = aa.a[9];
            t t1 = new t();
            a(t1);
            if(aa.a.m < 128)
            {
                g2.a(18, super.o - (g2.a[18] >> 1), t1.b - 5 - g2.b[18], 0, e1, 0);
                return;
            }
            g2.a(18, super.o - (g2.a[18] >> 1), t1.b - 6 - g2.b[18], 0, e1, 0);
        }
    }

    public final void a(e e1)
    {
        if(b)
            return;
        g g1 = aa.a[2];
        aj aj1;
        if(super.j == 3 || super.j == 22)
            switch((aj1 = aa.a(a)).a)
            {
            case 1: // '\001'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 0, e1);
                break;

            case 0: // '\0'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 0, e1);
                break;

            case 2: // '\002'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 0, e1);
                break;

            case 5: // '\005'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 2, e1);
                break;

            case 3: // '\003'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 3, e1);
                break;

            case 4: // '\004'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 2, e1);
                break;

            case 7: // '\007'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 3, e1);
                break;

            case 9: // '\t'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 1, e1);
                break;

            case 10: // '\n'
                g1.a(0, r, (super.o + p) - g1.a[0], (super.p + q) - g1.b[0], 1, e1);
                break;
            }
        if(super.j == 20 && super.k < super.a.s)
            g1.a(0, 10, (super.o + aa.a(super.a.a[super.k])) - (g1.a[0] >> 1), (super.p + aa.b(super.a.a[super.k])) - (g1.b[0] >> 1), 4, e1);
        if(aa.b() && aa.ac == super.a.b)
            aa.a(this);
    }

    public final void c(e e1)
    {
        if(super.j == 23 || super.j == 25 || super.j == 24 || super.j == 32)
            a.b(e1);
    }

    public final void d(e e1)
    {
        if(super.j == 23 || super.j == 25 || super.j == 24 || super.j == 32)
            a.c(e1);
    }

    public final byte a()
    {
        if(a != null)
        {
            if(aa.s < 255)
                return 5;
            if(aa.s < 384)
                return 1;
            return aa.s >= 768 ? 3 : 2;
        }
        if(a != null)
            return (byte)a.b[t];
        else
            return a;
    }

    public final void e(e e1)
    {
        if(aa.a.f != 0)
            return;
        if(aa.a.p == 1)
        {
            if(super.j == 16)
            {
                a.a(e1, true);
                return;
            }
            if(super.j == 19)
            {
                a.a(e1);
                return;
            }
            if((super.j == 20 || super.j == 36 || super.j == 21) && a.m < 500)
            {
                a.a(e1);
                return;
            }
            if(super.j == 35 && aa.k == 2)
            {
                a.a(e1, false);
                return;
            }
        } else
        if(super.j == 29 && a.c)
            a.a(e1, true);
    }

    private boolean a(int i1)
    {
        u u1;
        if((u1 = aa.a.a(this, i1)) == null)
            return false;
        if(super.j == 36)
        {
            return false;
        } else
        {
            super.j = 19;
            s = 0;
            a.m = 500;
            return true;
        }
    }

    private void k(int i1)
    {
        a(super.a.a + a(), i1);
        if(ai.a(66) == 0)
        {
            aa.a.f();
            return;
        }
        if(aa.a(16))
        {
            super.j = 36;
            s = 0;
            a.m = 0;
            a.a = false;
            a.j = 0;
            a.k = 0;
            aa.b();
        }
        a(i1);
    }

    private void l(int i1)
    {
        s += i1;
        if(s >= a.j)
        {
            super.j = 36;
            s = 0;
            a.m = 0;
            a.a = false;
            aa.b();
            return;
        }
        a(super.a.a + a(), i1);
        if(aa.a(16))
        {
            a.m = 0;
            a.a = true;
            a(aa.a);
            super.j = 20;
            aa.c(1);
        }
    }

    private void m(int i1)
    {
        s += i1;
        if(s >= a.j)
        {
            super.j = 18;
            return;
        } else
        {
            a(super.a.a + a(), i1);
            return;
        }
    }

    private void n(int i1)
    {
        if(a(super.a.f + a(), i1) && super.k < super.a.s)
        {
            int k2 = 1;
            int l2 = -1;
            if(super.k > 0)
            {
                k2 = aa.a(super.a.a[super.k]) - aa.a(super.a.a[super.k - 1]);
                if((l2 = aa.b(super.a.a[super.k]) - aa.b(super.a.a[super.k - 1])) > 10)
                    l2 = 10;
                if(l2 < -10)
                    l2 = -10;
                if(k2 > 10)
                    k2 = 10;
                if(k2 < -10)
                    k2 = -10;
            }
            int j1 = (450 + (16 - super.a.s) * 50) - aa.b(0, 150);
            aa.a.a.a((super.o + aa.a(super.a.a[super.k])) - aa.a.a, (super.p + aa.b(super.a.a[super.k])) - aa.a.b, j1, 0, 0, 4);
            if(aa.b(0, 100) <= 70)
            {
                int k1 = (450 + (16 - super.a.s) * 50) - aa.b(0, 150);
                aa.a.a.a((super.o + aa.a(super.a.a[super.k]) + 1) - aa.a.a, (super.p + aa.b(super.a.a[super.k]) + 1) - aa.a.b, k1, -(k2 >> 3), -(l2 >> 2), 4);
            }
            if(aa.b(0, 100) <= 70)
            {
                int l1 = (450 + (16 - super.a.s) * 50) - aa.b(0, 150);
                aa.a.a.a((super.o + aa.a(super.a.a[super.k])) - 2 - aa.a.a, (super.p + aa.b(super.a.a[super.k])) - 1 - aa.a.b, l1, -(k2 >> 3), -(l2 >> 2), 4);
            }
            if(aa.b(0, 100) <= 70)
            {
                int i2 = (450 + (16 - super.a.s) * 50) - aa.b(0, 150);
                aa.a.a.a((super.o + aa.a(super.a.a[super.k]) + 1) - aa.a.a, (super.p + aa.b(super.a.a[super.k])) - 3 - aa.a.b, i2, -(k2 >> 3), -(l2 >> 2), 4);
            }
            if(aa.b(0, 100) <= 70)
            {
                int j2 = (450 + (16 - super.a.s) * 50) - aa.b(0, 150);
                aa.a.a.a((super.o + aa.a(super.a.a[super.k])) - 2 - aa.a.a, (super.p + aa.b(super.a.a[super.k])) - 4 - aa.a.b, j2, -(k2 >> 3), -(l2 >> 2), 4);
            }
        }
        if(c() && !a(i1))
            super.j = 18;
        if(super.j == 20)
            a(aa.a);
    }

    private void o(int i1)
    {
        a(super.a.j, i1);
        if(c())
            super.j = 18;
    }

    private void p(int i1)
    {
        a(super.a.c + a(), i1);
        ab ab1 = (ab)a();
        B += i1;
        if(B < 350)
        {
            int j1 = aa.a((short)(super.o + 24), (short)(super.p - 5));
            a.o = (short)(a.e + (B * (aa.a(j1) - a.e)) / 350);
            a.p = (short)(a.f + (B * (aa.b(j1) - a.f)) / 350);
            a.c = ((q) (a)).o << 6;
            a.d = ((q) (a)).p << 6;
            ab1.o = (short)(((z) (ab1)).q + (B * (aa.a(j1) - ((z) (ab1)).q)) / 350);
            ab1.p = (short)(((z) (ab1)).r + (B * (aa.b(j1) - ((z) (ab1)).r)) / 350);
            return;
        } else
        {
            a.c();
            a.i = false;
            a = null;
            super.j = 34;
            aa.a.b[6]++;
            aa.a.b[2] += 100;
            return;
        }
    }

    private void q(int i1)
    {
        ab ab1 = (ab)a();
        a(super.a.a + a(), i1);
        if(((q) (ab1)).j == 2 && ab1.f == 0 && aa.a == 7)
        {
            aa.a(8, 321 + g, 68, 3, 1);
            g = (short)((g + 1) % 3);
            aa.a.f();
        }
    }

    public final z a()
    {
        if(super.d == null)
            return null;
        if(A >= super.d.length)
        {
            return null;
        } else
        {
            int i1;
            int j1 = (i1 = super.d[A] & 0xffff) & 0xfff;
            ab ab1;
            return ab1 = (ab)aa.a.a[9][j1];
        }
    }

    private void r(int i1)
    {