h.java

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

    }

    private boolean h()
    {
        switch(super.a.b)
        {
        case 0: // '\0'
        case 5: // '\005'
        case 9: // '\t'
        case 11: // '\013'
        case 13: // '\r'
        case 17: // '\021'
        case 18: // '\022'
        case 19: // '\023'
        case 22: // '\026'
        case 23: // '\027'
        case 24: // '\030'
            return false;

        case 1: // '\001'
        case 2: // '\002'
        case 3: // '\003'
        case 4: // '\004'
        case 6: // '\006'
        case 7: // '\007'
        case 8: // '\b'
        case 10: // '\n'
        case 12: // '\f'
        case 14: // '\016'
        case 15: // '\017'
        case 16: // '\020'
        case 20: // '\024'
        case 21: // '\025'
        default:
            return true;
        }
    }

    private boolean i()
    {
        if(b == null || b.E <= 0)
            return false;
        int i1 = ((q) (b)).o - super.o;
        int j1 = ((q) (b)).p - super.p;
        int k1 = q.a(i1) < q.a(j1) ? q.a(j1) : q.a(i1);
        boolean flag = false;
        if(k1 <= super.a.n)
            flag = aa.a.a(((q) (b)).o, ((q) (b)).p, super.o, super.p, (byte)0);
        switch(super.a.b)
        {
        case 7: // '\007'
        case 8: // '\b'
        case 10: // '\n'
        case 11: // '\013'
        case 14: // '\016'
        default:
            break;

        case 2: // '\002'
        case 3: // '\003'
        case 4: // '\004'
        case 5: // '\005'
        case 6: // '\006'
        case 9: // '\t'
        case 12: // '\f'
        case 13: // '\r'
        case 15: // '\017'
        case 16: // '\020'
        case 17: // '\021'
        case 18: // '\022'
        case 19: // '\023'
        case 20: // '\024'
        case 21: // '\025'
        case 22: // '\026'
        case 23: // '\027'
        case 24: // '\030'
            if(flag && aa.s > 512)
                flag = false;
            break;
        }
        return flag;
    }

    private boolean a(int i1)
    {
        boolean flag;
label0:
        {
            if(a == null)
            {
                if(super.j != 15)
                    super.a_ = super.m;
                return false;
            }
            flag = false;
            if(a == -1)
            {
                a = 0;
                b = 0;
                flag = true;
            }
            int j1 = a.a[a];
            int k1 = a.a[b];
            if(flag)
            {
                e = (short)(aa.a(j1) - super.o);
                f = (short)(aa.b(j1) - super.p);
                flag = false;
                a(k1, j1);
            }
            super.a_ = a(e, f);
            if(b(k1, j1, f, i1))
            {
                super.o = aa.a(j1);
                super.p = aa.b(j1);
                c = super.o << 6;
                d = super.p << 6;
                if(a != null)
                {
                    super.a_ = a.a[a];
                    if(b < a.a[a])
                        return false;
                } else
                if(b < d && (a == 0 || a == a.a - 1))
                    return false;
                c();
                j1 = a.a[a];
                int l1 = a.a[b];
                e = (short)(aa.a(j1) - super.o);
                f = (short)(aa.b(j1) - super.p);
                a(l1, j1);
                super.a_ = a(e, f);
                if(e == 0 && f == 0)
                    break label0;
            }
            flag = true;
        }
        return flag;
    }

    private boolean b(int i1)
    {
        if(a == null)
            return false;
        boolean flag = false;
        if(a == -1)
        {
            a = 0;
            b = 0;
            flag = true;
        }
        int j1 = a.a[a];
        int l1 = a.a[b];
        int l2 = q.a(m) < q.a(n) ? q.a(n) : q.a(m);
        if(flag)
        {
            if(super.a.b == 0 || super.a.b == 1 || super.a.b == 7 || super.a.b == 8)
            {
                e = (short)(aa.a(j1) - super.o);
                f = (short)(aa.b(j1) - super.p);
                a(l1, j1);
            }
            flag = false;
        }
        super.a_ = a(e, f);
        short word0 = e;
        short word2 = f;
        if(l2 > 4)
        {
            int i3 = c;
            int j3 = d;
            int k3 = c;
            int l3 = d;
            int i4 = 0x10000;
            int j4 = 0x10000;
            if(!b(l1, j1, f, i1))
            {
                int k4 = ((q) (b)).o - super.o;
                int i5 = ((q) (b)).p - super.p;
                i4 = q.a(k4) < q.a(i5) ? q.a(i5) : q.a(k4);
                k3 = c;
                l3 = d;
                flag = true;
            }
            short word4 = a;
            short word5 = c;
            if(flag)
            {
                c = (short)(-c);
                c();
                j1 = a.a[a];
                int i2 = a.a[b];
                if(a != word4 && (b > super.a.q << 4 || b == 0))
                {
                    word0 = (short)(aa.a(j1) - super.o);
                    word2 = (short)(aa.b(j1) - super.p);
                    if(word0 != 0 || word2 != 0)
                    {
                        if(q.a(word0) >= q.a(word2))
                        {
                            n = (short)((word2 << 6) / q.a(word0));
                            if(word0 > 0)
                                m = 64;
                            else
                                m = -64;
                        } else
                        {
                            m = (short)((word0 << 6) / q.a(word2));
                            if(word2 > 0)
                                n = 64;
                            else
                                n = -64;
                        }
                    } else
                    {
                        m = 0;
                        n = 0;
                    }
                    if(!b(i2, j1, f, i1))
                    {
                        int l4 = ((q) (b)).o - super.o;
                        int j5 = ((q) (b)).p - super.p;
                        j4 = q.a(l4) < q.a(j5) ? q.a(j5) : q.a(l4);
                    }
                    b = 0;
                }
                if(j4 < i4)
                {
                    e = word0;
                    f = word2;
                    a(i2, j1);
                    c = i3;
                    d = j3;
                    super.o = (short)(c >> 6);
                    super.p = (short)(d >> 6);
                    flag = false;
                } else
                {
                    b = a;
                    a = word4;
                    c = word5;
                    short word1 = (short)(aa.a(j1 = a.a[a]) - super.o);
                    short word3 = (short)(aa.b(j1) - super.p);
                    if(word1 != 0 || word3 != 0)
                    {
                        if(q.a(word1) >= q.a(word3))
                        {
                            n = (short)((word3 << 6) / q.a(word1));
                            if(word1 > 0)
                                m = 64;
                            else
                                m = -64;
                        } else
                        {
                            m = (short)((word1 << 6) / q.a(word3));
                            if(word3 > 0)
                                n = 64;
                            else
                                n = -64;
                        }
                    } else
                    {
                        m = 0;
                        n = 0;
                    }
                    if(flag)
                    {
                        c = k3;
                        d = l3;
                    } else
                    {
                        c = i3;
                        d = j3;
                    }
                    super.o = (short)(c >> 6);
                    super.p = (short)(d >> 6);
                }
            } else
            {
                super.o = aa.a(j1);
                super.p = aa.b(j1);
                c = super.o << 6;
                d = super.p << 6;
                c();
                if(super.a.b == 0 || super.a.b == 1 || super.a.b == 7 || super.a.b == 8 || super.a.b == 14)
                {
                    j1 = a.a[a];
                    int j2 = a.a[b];
                    e = (short)(aa.a(j1) - super.o);
                    f = (short)(aa.b(j1) - super.p);
                    a(j2, j1);
                }
            }
        } else
        {
            super.o = aa.a(j1);
            super.p = aa.b(j1);
            c = super.o << 6;
            d = super.p << 6;
            c();
            if(super.a.b == 0 || super.a.b == 1 || super.a.b == 7 || super.a.b == 8 || super.a.b == 14)
            {
                int k1 = a.a[a];
                int k2 = a.a[b];
                e = (short)(aa.a(k1) - super.o);
                f = (short)(aa.b(k1) - super.p);
                a(k2, k1);
            }
        }
        return flag;
    }

    private boolean b(boolean flag)
    {
        if(a == null)
            return false;
        if(b < super.a.q)
            return false;
        boolean flag1 = false;
        if(a == -1)
            a = 0;
        boolean flag2 = false;
        super.a_ = a(e, f);
        o o1 = aa.a.a;
        if(aa.s > 255 && super.j != 5 && super.j != 19)
            return false;
        if(super.j == 5)
        {
            flag1 = true;
            b = 0;
        } else
        {
            flag1 = false;
            super.j = 19;
            g = 0;
        }
        if(flag1)
        {
            if(flag)
            {
                a = (short)(aa.s % a.a);
                flag1 = false;
                short word0 = super.o;
                short word1 = super.p;
                while(!flag1) 
                {
                    a += c;
                    if(a < 0)
                        a = (short)(a.a - 1);
                    if(a >= a.a)
                        a = 0;
                    int i1 = a.a[a];
                    super.o = aa.a(i1);
                    super.p = aa.b(i1);
                    e = (short)(aa.a(i1) - ((q) (o1)).o);
                    f = (short)(aa.b(i1) - ((q) (o1)).p);
                    if(!a(((q) (o1)).o + ((z) (o1)).a.a, ((q) (o1)).p + ((z) (o1)).a.b, ((q) (o1)).o + ((z) (o1)).a.c, ((q) (o1)).p + ((z) (o1)).a.d) && (super.o != word0 || super.p != word1))
                        flag1 = true;
                    else
                        flag1 = false;
                }
            }
        } else
        {
            a += c;
            if(a < 0)
                a = (short)(a.a - 1);
            else
            if(a >= a.a)
                a = 0;
            int j1 = a.a[a];
            super.o = aa.a(j1);
            super.p = aa.b(j1);
            e = (short)(aa.a(j1) - ((q) (o1)).o);
            f = (short)(aa.b(j1) - ((q) (o1)).p);
        }
        return flag1;
    }

    private void c()
    {
        b = a;
        a += c;
        if(a < 0)
            if(a)
            {
                a = 1;
                b = 0;
                c = 1;
            } else
            if(a.a)
            {
                a = (short)(a.a - 1);
                b = 0;
            } else
            {
                a = 0;
                b = 0;
            }
        if(a >= a.a)
        {
            if(a)
            {
                a = (short)(a.a - 2);
                b = (short)(a.a - 1);
                c = -1;
                return;
            }
            if(a.a)
            {
                a = 0;
                b = (short)(a.a - 1);
                return;
            }
            a = (short)(a.a - 1);
            b = (short)(a.a - 1);
        }
    }

    public final void b(e e1)
    {
        if(super.j != 1 && super.j != 3 && super.j != 18)
        {
            int i1 = aa.o;
            int j1 = aa.p;
            if(a != null && (super.j == 13 || super.j == 14))
            {
                t t1 = new t();
                a.a(t1);
                t1.a -= e1.a;
                t1.b -= e1.b;
                t1.a += 4;
                t1.b += 4;
                aa.a.setClip(t1.a, t1.b, i1, j1);
            }
            g g1 = super.a.a;
            l l1;
            int ai1[] = (l1 = super.a.a[super.b]).a[super.k];
            boolean flag = false;
            switch(super.a.b)
            {
            case 11: // '\013'
                if(g1 == null || super.b == 255)
                {
                    aa.a.setClip(0, 0, i1, j1);
                    return;
                }
                for(int k1 = l1.a[super.k] - 1; k1 >= 0; k1--)
                {
                    int i2;
                    int j2 = (i2 = ai1[k1]) & 0xff;
                    byte byte0 = (byte)(i2 >> 8 & 0xff);
                    char c1 = (byte)(i2 >> 16 & 0xff);
                    int k2 = i2 >> 24 & 0xff;
                    int l2 = super.o + byte0;
                    if(j2 == 3)
                        c1 = '\uFF79';
                    o o1 = aa.a.a;
                    if(super.p > ((q) (o1)).p)
                    {
                        t t3;
                        (t3 = new t()).a = (short)(((q) (o1)).o + -8);
                        t3.c = (short)(((q) (o1)).o + 8);
                        t3.b = (short)(((q) (o1)).p + -40);
                        t3.d = (short)(((q) (o1)).p + 0);
                        aa.a[27].a(j2, l2, super.p + c1, k2, e1, 0);