z.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;

import java.util.Random;
import java.util.Vector;
import javax.microedition.lcdui.Graphics;

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

class Z
{

    C I;
    int x;
    int y;
    int Z;
    int C;
    int B;
    int D;
    int F;
    int J;
    int S;
    int A;
    int E;
    int G;
    int H;
    boolean K;
    int L;
    int M;
    int N;
    int O;
    boolean P;
    boolean Q;
    boolean R;
    int abs;
    int T;
    int U;
    long V;
    long append;
    int currentTimeMillis;
    int W[][];
    int X;
    int Y;
    int i;
    int z;
    int firstElement[] = {
        1, 0, 9, 6, 5, 5, 5, 11, 3, 8, 
        10, 6, 7, 14
    };
    int lastElement;

    Z(C c)
    {
        M = 2;
        abs = 6;
        lastElement = 0;
        I = c;
        Q = false;
        Y = 0;
        i = 0;
        z = 0;
        J();
    }

    final void I(boolean flag)
    {
        Q = flag;
    }

    final void J()
    {
        G = 0;
        K = true;
        T = 0;
        U = 0;
        currentTimeMillis = 0;
        V = I.C();
        append = I.C();
        x = 0;
        y = 0;
        Z = 0;
        C = 0;
        B = 0;
        D = 0;
        E = 0;
        L = C.G;
        R = false;
        O = 0;
        P = false;
        I(0);
    }

    final int S()
    {
        byte byte0 = 0;
        if(N == -1)
            byte0 = 50;
        return W[G][0] * N - byte0;
    }

    final int A()
    {
        return W[G][1] + 40;
    }

    int F()
    {
        if(G < 14)
        {
            if(N == 1)
                return firstElement[G] + S;
            else
                return firstElement[G] + S + 0;
        } else
        {
            return 0;
        }
    }

    private final int abs()
    {
        return W[G][2];
    }

    private final int append()
    {
        return W[G][3];
    }

    final int E()
    {
        return W[G][4];
    }

    private final int currentTimeMillis()
    {
        return W[G][5];
    }

    private final int firstElement()
    {
        return W[G][6];
    }

    private final int lastElement()
    {
        return W[G][7];
    }

    private final int longValue()
    {
        return W[G][8];
    }

    private final int nextInt()
    {
        return W[G][9];
    }

    void I(int j)
    {
    }

    final void Z(int j)
    {
        E = j;
        if(E == 0 && (G == 2 || G == 9))
        {
            I(0);
            if(!Q)
                O = 0;
        }
    }

    void I()
    {
        if(G == 3 || G == 11)
            return;
        if(E == 0)
        {
            if(!Q)
                O = 0;
            if(G == 8)
            {
                I(0);
                B = 0;
                D = 0;
            }
            return;
        }
        if(G == 8)
            return;
        switch(E)
        {
        case 6: // '\006'
        case 7: // '\007'
        case 14: // '\016'
        default:
            break;

        case 3: // '\003'
        case 11: // '\013'
            if(G == 0)
            {
                if(N == 1)
                    O = 1;
                I(8);
                B = -abs;
                break;
            }
            if(G == 4 && V > I.C())
            {
                E = 0;
                I(6);
            }
            break;

        case 4: // '\004'
        case 13: // '\r'
            if(G == 0)
            {
                if(N == -1)
                    O = 1;
                I(8);
                B = abs;
                break;
            }
            if(G == 4 && V > I.C())
            {
                E = 0;
                I(5);
            }
            break;

        case 1: // '\001'
        case 9: // '\t'
            if(G == 0)
            {
                I(4);
                E = 0;
            }
            break;

        case 8: // '\b'
            if(G == 0)
            {
                I(6);
                E = 0;
            }
            break;

        case 10: // '\n'
            if(G == 0)
            {
                I(5);
                E = 0;
            }
            break;

        case 2: // '\002'
        case 15: // '\017'
            if(G == 0 && append > I.C())
            {
                I(7);
                E = 0;
                break;
            }
            if(G == 0)
            {
                O = 2;
                append = I.C() + 500L;
                I(2);
                E = 0;
            }
            break;

        case 5: // '\005'
        case 12: // '\f'
            if(G == 0)
            {
                I(1);
                E = 0;
                break;
            }
            if(G == 4 || G == 6 || G == 5)
            {
                int j = B;
                int k = D;
                I(13);
                B = j;
                D = k;
                E = 0;
            }
            break;
        }
    }

    private final Z setElementAt()
    {
        if(this == I.O)
            return I.P;
        else
            return I.O;
    }

    private final void toString(int j)
    {
        L -= j;
        if(L < 0)
            L = 0;
        I.Y = true;
    }

    private final void abs(int j)
    {
        T += j;
        if(T >= 100)
            if(U < 3)
            {
                T = 0;
                U++;
            } else
            {
                T = 100;
            }
        I.Y = true;
    }

    private final boolean G()
    {
        return O == 2;
    }

    private final boolean H()
    {
        return O == 1 || O == 2;
    }

    private final boolean I(int j, int k, int l, int i1)
    {
        int j1;
        int k1;
        int l1;
        int i2;
        if(N == 1)
        {
            j1 = x + abs() + S();
            k1 = y + append() + A();
            l1 = E();
            i2 = currentTimeMillis();
        } else
        {
            j1 = ((x - abs()) + S() + 50) - E();
            k1 = y + append() + A();
            l1 = E();
            i2 = currentTimeMillis();
        }
        return C.Z(j1, l1, j, l) && C.I(k1, i2, k, i1);
    }

    private final boolean K()
    {
        int j1 = 0;
        int k1 = 0;
        int l1 = 0;
        int i2 = 0;
        Z z1 = setElementAt();
        int j;
        int k;
        int l;
        int i1;
        if(Z() || G == 7)
        {
            if(N == 1)
            {
                j = x + firstElement() + S();
                k = y + lastElement() + A();
                l = longValue();
                i1 = nextInt();
            } else
            {
                j = ((x - firstElement()) + S() + 50) - longValue();
                k = y + lastElement() + A();
                l = longValue();
                i1 = nextInt();
            }
        } else
        if(N == 1)
        {
            j = x + B + abs() + S();
            k = y + D + append() + A();
            l = E();
            i1 = currentTimeMillis();
        } else
        {
            j = ((x - abs()) + S() + 50) - E();
            k = y + append() + A();
            l = E();
            i1 = currentTimeMillis();
        }
        if(z1.Z() || z1.G == 7)
        {
            if(z1.N == 1)
            {
                j1 = z1.x + z1.firstElement() + z1.S();
                k1 = z1.y + z1.lastElement() + z1.A();
                l1 = z1.longValue();
                i2 = z1.nextInt();
            } else
            {
                j1 = ((z1.x - z1.firstElement()) + z1.S() + 50) - z1.longValue();
                k1 = z1.y + z1.lastElement() + z1.A();
                l1 = z1.longValue();
                i2 = z1.nextInt();
            }
        } else
        if(N == 1)
        {
            j1 = z1.x + z1.abs() + z1.S();
            k1 = z1.y + z1.append() + z1.A();
            l1 = z1.E();
            i2 = z1.currentTimeMillis();
        } else
        {
            j1 = ((z1.x - z1.abs()) + z1.S() + z1.B + 50) - z1.E();
            k1 = z1.y + z1.append() + z1.A();
            l1 = z1.E();
            i2 = z1.currentTimeMillis();
        }
        return C.Z(j, l, j1, l1) && C.I(k, i1, k1, i2);
    }

    boolean B()
    {
        return false;
    }

    final void L()
    {
        C _tmp = I;
        Kof _tmp1 = I.I;
        int j = Math.abs((C.H.nextInt() % 1000) / (Kof.E + 1 + 3));
        Z z1 = setElementAt();
        if(Kof.I)
        {
            lastElement++;