⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 a.java

📁 哈利波特与凤凰令的一个小游戏
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
            break;

        case 102: // 'f'
            o1.e = true;
            if(af1 != null)
            {
                int j3 = aa.a(af1.a[2]);
                int l4 = aa.b(af1.a[2]);
                e1.a((short)j3, (short)l4, false);
                if(e1.a == j3 && e1.b == l4)
                {
                    e += i1;
                    if(e > b)
                        d = 103;
                } else
                {
                    e = 0;
                    return;
                }
            } else
            {
                d = 103;
                return;
            }
            break;

        case 103: // 'g'
            o1.e = true;
            if(af1 != null)
            {
                int k3 = aa.a(af1.a[3]);
                int i5 = aa.b(af1.a[3]);
                e1.a((short)k3, (short)i5, false);
                if(e1.a == k3 && e1.b == i5)
                {
                    d = 104;
                    aa.h(d);
                }
                return;
            } else
            {
                d = 104;
                aa.h(d);
                return;
            }

        case 104: // 'h'
            o1.e = true;
            if(!aa.c())
            {
                d = 105;
                return;
            }
            break;

        case 105: // 'i'
            o1.e = true;
            if(af1 != null)
            {
                short word0 = aa.a(af1.a[4]);
                short word1 = aa.b(af1.a[4]);
                e1.a(word0, word1, false);
                if(e1.a == word0 && e1.b == word1)
                {
                    d = 106;
                    o1.j = 15;
                    e = 0;
                    if(super.d != null)
                    {
                        for(int j1 = 0; j1 < super.d.length; j1++)
                        {
                            int j6;
                            int k7 = (j6 = super.d[j1] & 0xffff) & 0xfff;
                            h h1;
                            int i8;
                            if((i8 = j6 >> 12) == 1)
                                switch(((z) (h1 = (h)ai1.a[i8][k7])).a.b)
                                {
                                case 5: // '\005'
                                case 6: // '\006'
                                case 9: // '\t'
                                case 13: // '\r'
                                case 15: // '\017'
                                case 16: // '\020'
                                case 17: // '\021'
                                case 18: // '\022'
                                    h1.a = ((z) (h1)).a.p;
                                    break;
                                }
                        }

                    }
                }
                return;
            }
            d = 106;
            o1.j = 15;
            e = 0;
            if(super.d == null)
                break;
            int k1 = 0;
            do
            {
                if(k1 >= super.d.length)
                    break label0;
                int l3;
                int j5 = (l3 = super.d[k1] & 0xffff) & 0xfff;
                h h2;
                int k6;
                if((k6 = l3 >> 12) == 1)
                    switch(((z) (h2 = (h)ai1.a[k6][j5])).a.b)
                    {
                    case 5: // '\005'
                    case 6: // '\006'
                    case 9: // '\t'
                    case 13: // '\r'
                    case 15: // '\017'
                    case 16: // '\020'
                    case 17: // '\021'
                    case 18: // '\022'
                        h2.a = ((z) (h2)).a.p;
                        break;
                    }
                k1++;
            } while(true);

        case 106: // 'j'
            ai1.a.e = true;
            e += i1;
            if(af1 != null)
                e1.a(aa.a(af1.a[4]), aa.b(af1.a[4]), true);
            if(super.d != null)
            {
                for(int l1 = 0; l1 < super.d.length; l1++)
                {
                    int i4;
                    int k5 = (i4 = super.d[l1] & 0xffff) & 0xfff;
                    h h3;
                    int l6;
                    if((l6 = i4 >> 12) == 1)
                        switch(((z) (h3 = (h)ai1.a[l6][k5])).a.b)
                        {
                        case 5: // '\005'
                        case 6: // '\006'
                        case 9: // '\t'
                        case 13: // '\r'
                        case 15: // '\017'
                        case 16: // '\020'
                        case 17: // '\021'
                        case 18: // '\022'
                            a(h3, i1);
                            break;
                        }
                }

            }
            a(o1, i1);
            if(e >= c)
            {
                d = 107;
                return;
            }
            break;

        case 107: // 'k'
            ai1.a.e = true;
            ai1.a.j = 0;
            aa.f();
            d = 108;
            return;

        case 108: // 'l'
            ai1.a.e = true;
            if(super.d != null)
            {
                for(int i2 = 0; i2 < super.d.length; i2++)
                {
                    int j4;
                    int l5 = (j4 = super.d[i2] & 0xffff) & 0xfff;
                    h h4;
                    int i7;
                    if((i7 = j4 >> 12) == 1)
                        switch(((z) (h4 = (h)ai1.a[i7][l5])).a.b)
                        {
                        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 21: // '\025'
                            h4.j = 1;
                            break;
                        }
                }

            }
            z az[] = ai.a[0];
            for(int j2 = 0; j2 < 16; j2++)
                az[j2].i = false;

            az = ai.a[1];
            for(int k2 = 0; k2 < 16; k2++)
                az[k2].i = false;

            aa.g();
            d = 109;
            return;

        case 109: // 'm'
            ai1.a.e = true;
            if(super.d != null)
            {
                for(int l2 = 0; l2 < super.d.length; l2++)
                {
                    int i6;
                    int j7 = (i6 = super.d[l2] & 0xffff) & 0xfff;
                    h h5;
                    int l7;
                    if((l7 = i6 >> 12) == 1)
                        switch(((z) (h5 = (h)ai1.a[l7][j7])).a.b)
                        {
                        case 2: // '\002'
                        case 3: // '\003'
                        case 4: // '\004'
                            h5.j = 4;
                            break;
                        }
                }

            }
            if(c())
            {
                super.j = 2;
                e();
                aa.a.a.e = false;
                o1.c = true;
            }
            break;
        }
    }

    private void m()
    {
        boolean flag = false;
        ai ai1;
        o o1 = (ai1 = aa.a).a;
        h h1 = null;
        e e1 = ai1.a;
        if(super.d != null)
        {
            int i1 = 0;
            do
            {
                if(i1 >= super.d.length)
                    break;
                short word0;
                int j1 = (word0 = super.d[i1]) & 0xfff;
                int k1;
                if((k1 = word0 >> 12) == 1 && ((z) (h1 = (h)ai1.a[k1][j1])).a.b == 24)
                    break;
                i1++;
            } while(true);
        }
        switch(d)
        {
        default:
            break;

        case 100: // 'd'
            e1.a(o1, false);
            if(e1.a + (e1.i >> 1) == ((q) (o1)).o && e1.b + (e1.j >> 1) == ((q) (o1)).p)
            {
                d = 101;
                if(a > 0)
                {
                    aa.h(a);
                    return;
                }
            }
            break;

        case 101: // 'e'
            o1.e = true;
            if(!aa.c())
            {
                d = 102;
                return;
            }
            break;

        case 102: // 'f'
            h1.j = 0;
            e1.a((short)((((q) (h1)).o + 20) - (e1.i >> 1)), (short)(((q) (h1)).p - 50 - (e1.j >> 1)), false);
            if(!e1.a())
                break;
            d = 103;
            if(b > 0)
            {
                aa.h(b);
                return;
            }
            break;

        case 103: // 'g'
            e1.a((short)((((q) (h1)).o + 20) - (e1.i >> 1)), (short)(((q) (h1)).p - 50 - (e1.j >> 1)), false);
            o1.e = true;
            if(!aa.c())
                aa.a.h();
            break;
        }
    }

    private void n()
    {
        super.j = 1;
        d = 0;
        af af1 = (af)a();
        e e1 = aa.a.a;
        o o1;
        ak ak1 = (o1 = aa.a.a).a;
        o1.e = true;
        ak1.a(aa.a(af1.a[0]), aa.b(af1.a[0]));
        e1.a((short)(aa.a(af1.a[1]) - (e1.i >> 1)), (short)(aa.b(af1.a[1]) - (e1.j >> 1)), true);
        e = 0;
        aa.a.f = 18;
    }

    private void d(int i1)
    {
        af af1 = (af)a();
        e e1 = aa.a.a;
        o o1;
        ak ak1 = (o1 = aa.a.a).a;
        if(d < af1.a - 1 && aa.a(1024))
        {
            aa.e();
            o1.b((short)a, (short)b, a_);
            super.j = 2;
            aa.a.f = 0;
            return;
        }
        if(d == 0)
        {
            short word0 = aa.a(af1.a[1]);
            short word3 = aa.b(af1.a[1]);
            e1.a((short)(word0 - (e1.i >> 1)), (short)(word3 - (e1.j >> 1)), true);
            short word6 = aa.a(af1.a[0]);
            short word9 = aa.b(af1.a[0]);
            short word12 = aa.a(af1.a[1]);
            short word14 = aa.b(af1.a[1]);
            e += i1;
            if(e < 2500)
            {
                ak1.a(word6, word9, word12, word14, e, 2500, i1);
                return;
            } else
            {
                e = 0;
                d++;
                return;
            }
        }
        if(d < af1.a - 1)
        {
            short word1 = aa.a(af1.a[d]);
            short word4 = aa.b(af1.a[d]);
            short word7 = aa.a(af1.a[d + 1]);
            short word10 = aa.b(af1.a[d + 1]);
            int j1 = 7000 / (af1.a - 2);
            e += i1;
            if(e < j1)
            {
                ak1.a(word1, word4, word7, word10, e, j1, i1);
                e1.a((short)(((q) (ak1)).o - (e1.i >> 1)), (short)(((q) (ak1)).p - (e1.j >> 1)), false);
                return;
            }
            e = 0;
            d++;
            e1.a((short)(((q) (ak1)).o - (e1.i >> 1)), (short)(((q) (ak1)).p - (e1.j >> 1)), false);
            if(d < af1.a - 1)
                return;
        }
        short word2 = aa.a(af1.a[af1.a - 1]);
        short word5 = aa.b(af1.a[af1.a - 1]);
        e1.a((short)(word2 - (e1.i >> 1)), (short)(word5 - (e1.j >> 1)), true);
        if(d == af1.a - 1)
        {
            short word8 = (short)(2 * aa.a(af1.a[d]) - aa.a(af1.a[d - 1]));
            short word11 = (short)(2 * aa.b(af1.a[d]) - aa.b(af1.a[d - 1]));
            short word13 = aa.a(af1.a[d]);
            short word15 = aa.b(af1.a[d]);
            e += i1;
            if(e < 5000 && ak1.a(e1))
            {
                ak1.a(word13, word15, word8, word11, e, 5000, i1);
                return;
            }
            d++;
        }
        switch(d - af1.a)
        {
        case 0: // '\0'
            aa.h(c);
            d++;
            return;

        case 1: // '\001'
            if(!aa.c())
            {
                aa.f();
                d++;
                return;
            }
            break;

        case 2: // '\002'
            o1.b((short)a, (short)b, a_);
            d++;
            super.j = 2;
            aa.a.f = 0;
            break;
        }
    }

    public final void a(e e1)
    {
        if(super.j != 1)
            return;
        switch(a)
        {
        case 18: // '\022'
            aa.a.a.a.b(e1);
            af af1 = (af)a();
            if(d >= af1.a)
            {
                g g1;
                (g1 = aa.a[22]).a(16, 0, e1.j - 127, 0, e1, true, 0);
                return;
            }
            aa.a(357, 0, aa.p - 3, (byte)8, e1, 0);
            break;
        }
    }

    public final void b(e e1)
    {
    }

    private void o()
    {
        d = 100;
        aa.a.a.b = true;
        aa.a.a.e = true;
        aa.a.a.a((short)a, (short)b, true);
    }

    private void e(int i1)
    {
        ai ai1 = aa.a;
        aa.a.a.a((short)a, (short)b, true);
        switch(d)
        {
        default:
            break;

        case 100: // 'd'
            aa.h(d);
            d = 101;
            return;

        case 101: // 'e'
            if(!aa.c())
            {
                d = 102;
                e = 1520;
                return;
            }
            break;

        case 102: // 'f'
            int j1 = super.d[0] & 0xfff;
            h h1;
            a(h1 = (h)ai1.a[1][j1], i1);
            e -= i1;
            if(e <= 0)
            {
                aa.f();
                d = 103;
                return;
            }
            break;

        case 103: // 'g'
            aa.i();
            ai1.a.b((short)324, (short)289, a_);
            ai1.a.a_ = 3;
            ai1.a.a(ai1.a, true);
            ai1.a.e = false;
            super.j = 2;
            break;
        }
    }

    private void p()
    {
        int k1;
        ai ai1;
        boolean flag = true;
        int i1 = 0;
        k1 = 0;
        ai1 = aa.a;
        if(super.d != null)
        {
            i1 = 0;
            do
            {
                if(i1 >= super.d.length)
                    break;
                int l1;
                int i2 = (l1 = super.d[i1] & 0xffff) & 0xfff;
                h h1;
                int k2;
                if((k2 = l1 >> 12) == 1 && (((q) (h1 = (h)ai1.a[k2][i2])).j == 11 || ((q) (h1)).j == 12))
                {
                    flag = false;
                    break;
                }
                i1++;
            } while(true);
        }
        z az[] = ai.a[0];
        i1 = 0;
        do
        {
            if(i1 >= 16)
                break;
            if(az[i1].i)
            {
                flag = false;
                break;
            }
            i1++;
        } while(true);
        if(!flag)
            break MISSING_BLOCK_LABEL_274;
        if(super.d == null) goto _L2; else goto _L1
_L1:
        int j1 = 0;
_L3:
        if(j1 < super.d.length)
        {
            int j2;
            int l2 = (j2 = super.d[j1] & 0xffff) & 0xfff;
            int i3;
            if((i3 = j2 >> 12) != 1)
                continue; /* Loop/switch isn't completed */
            h h2;
            (h2 = (h)ai1.a[i3][l2]).j = 4;
            if(k1 == 0)
            {
                h2.a_ = 0;
                k1++;
                continue; /* Loop/switch isn't completed */
            }
            if(k1 != 1)
                continue; /* Loop/switch isn't completed */
            h2.a_ = 1;
        }
        break; /* Loop/switch isn't completed */
        j1++;
          goto _L3
_L2:
        ai1.a.a_ = 3;
        ai1.a.e = true;
        super.j = 1;
        return;
        super.j = 0;
        return;
    }

    private void q()
    {
        aa.a.a.e = true;
        if(b())
        {
            e();
            super.j = 2;
        }
    }
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -