j.java

J2ME拳王游戏

// Decompiled by Jad v1.5.7g. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi 

package kof;


// Referenced classes of package kof:
//            Z, C, Kof

class J extends Z
{

    J(C c)
    {
        super(c);
        X = 3;
        Y = 16;
        i = 15;
        z = 14;
        W = (new int[][] {
            new int[] {
                -6, -50, 11, 12, 21, 37, -1, -1, -1, -1
            }, new int[] {
                -3, -50, 6, 12, 21, 37, 34, 23, 15, 12
            }, new int[] {
                0, -50, 14, 17, 22, 32, -1, -1, -1, -1
            }, new int[] {
                0, -50, 2, 7, 15, 24, -1, -1, -1, -1
            }, new int[] {
                -9, -50, 13, 0, 17, 44, -1, -1, -1, -1
            }, new int[] {
                -9, -50, 13, 0, 17, 44, -1, -1, -1, -1
            }, new int[] {
                -9, -50, 13, 0, 17, 44, -1, -1, -1, -1
            }, new int[] {
                -9, -50, 6, 20, 24, 29, 27, 27, 22, 8
            }, new int[] {
                -8, -50, 15, 8, 17, 41, -1, -1, -1, -1
            }, new int[] {
                0, -50, 3, 7, 14, 24, -1, -1, -1, -1
            }, new int[] {
                0, -50, 8, 9, 15, 22, -1, -1, -1, -1
            }, new int[] {
                0, -50, 2, 7, 15, 24, -1, -1, -1, -1
            }, new int[] {
                0, -50, 0, 20, 26, 11, -1, -1, -1, -1
            }, new int[] {
                -5, -50, 2, 8, 25, 30, 32, 28, 13, 13
            }, new int[] {
                -5, -50, 13, 11, 22, 38, 32, 6, 15, 29
            }, new int[] {
                -5, -50, 13, 4, 21, 45, 22, 11, 5, 10
            }, new int[] {
                -5, -50, 4, 7, 12, 24, -1, -1, -1, -1
            }
        });
    }

    final void I()
    {
        switch(E)
        {
        default:
            break;

        case 5: // '\005'
        case 12: // '\f'
            if(G != 0)
                break;
            if(N == 1)
            {
                if(U > 0 && super.I.D() && super.I.I(0) == 0)
                {
                    super.I.K = System.currentTimeMillis() + 1000L;
                    U--;
                    I(16);
                    E = 0;
                    R = true;
                    return;
                }
                if(super.I.B() && super.I.I(0) == 0)
                {
                    I(15);
                    E = 0;
                    return;
                }
                if(super.I.J())
                {
                    I(14);
                    E = 0;
                    return;
                }
                break;
            }
            if(U > 0 && super.I.F() && super.I.I(0) == 0)
            {
                super.I.K = System.currentTimeMillis() + 1000L;
                U--;
                I(16);
                E = 0;
                R = true;
                return;
            }
            if(super.I.J() && super.I.I(0) == 0)
            {
                I(15);
                E = 0;
                return;
            }
            if(super.I.B())
            {
                I(14);
                E = 0;
                return;
            }
            break;
        }
        super.I();
    }

    final void I(int i)
    {
        if(G == i)
            return;
        H = i;
        G = i;
        S = 0;
        A = 0;
        P = false;
        super.B = 0;
        super.D = 0;
        switch(G)
        {
        case 0: // '\0'
            K = true;
            O = 0;
            R = false;
            break;

        case 4: // '\004'
            super.D = -13;
            V = super.I.C() + 500L;
            break;

        case 6: // '\006'
            super.B = -5;
            super.D = -13;
            break;

        case 5: // '\005'
            super.B = 5;
            super.D = -13;
            break;

        case 13: // '\r'
            P = true;
            break;

        case 1: // '\001'
        case 7: // '\007'
            P = true;
            break;

        case 14: // '\016'
            super.B = 5 * N;
            super.D = -9;
            P = true;
            break;

        case 16: // '\020'
            Kof _tmp = super.I.I;
            Kof.I("kof.mid.powerup", 0);
            break;
        }
    }

    final boolean Z()
    {
        if(G == 14)
            return true;
        else
            return super.Z();
    }

    final void D()
    {
        if(Q)
        {
            C _tmp = super.I;
            if(C.C == 7)
                L();
        }
        if(G == 14)
        {
            super.D += M;
            if(y + super.D > super.I.i)
            {
                y = super.I.i;
                if(G != 12)
                    I(0);
                super.D = 0;
            }
        } else
        if(G == 16 && super.I.K < System.currentTimeMillis() + 100L)
        {
            super.I.K = 0L;
            I(15);
            super.I.X = true;
        }
        super.D();
    }

    final boolean B()
    {
        return G == 16;
    }

    final void C()
    {
        if(G == 14)
        {
            if(++A > 3)
            {
                if(++S >= 3)
                    S = 2;
                A = 0;
            }
        } else
        if(G == 15)
        {
            if(++A > 1)
            {
                if(++S >= 2)
                {
                    I(0);
                    super.I.I(R, Q, 0, N, x + S() + E() / 2, y + A());
                    if(R)
                    {
                        super.I.I(R, Q, 0, N, (x + S() + E() / 2) - 5, y + A());
                        super.I.I(R, Q, 0, N, (x + S() + E() / 2) - 10, y + A());
                        R = false;
                    }
                }
                A = 0;
            }
        } else
        if(G == 16)
        {
            if(++S >= 2)
                S = 0;
            A = 0;
        } else
        {
            super.C();
        }
    }

    final int F()
    {
        int i = 0;
        i = super.F();
        if(i == 0)
        {
            if(G == 14)
                if(N == 1)
                    return 15 + S;
                else
                    return 15 + S + 0;
            if(G == 15)
                if(N == 1)
                    return 18 + S;
                else
                    return 18 + S + 0;
            if(G == 16)
            {
                if(N == 1)
                    return 12 + S;
                else
                    return 12 + S + 0;
            } else
            {
                return 0;
            }
        } else
        {
            return i;
        }
    }
}