i.java

魂斗罗游戏的原码(j2me) 是学习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 mdigi;

import java.util.Random;

// Referenced classes of package mdigi:
//            a

public class i
{

    private int c;
    private int f;
    int d;
    private int z;
    private int o;
    private int G;
    private int C;
    public int u;
    public int B;
    private int v;
    public int t;
    public int D;
    private a b;
    private Random E;
    private boolean m;
    public boolean x;
    public boolean l;
    public boolean a;
    public boolean A;
    public boolean j;
    public boolean q;
    public boolean F;
    public boolean p;
    public boolean n;
    public boolean e;
    public boolean i;
    public boolean I;

    public i(a a1)
    {
        c = 0;
        f = 0;
        d = 2;
        z = 0;
        o = 0;
        G = 0;
        C = 3;
        u = 0;
        B = 0;
        v = 0;
        t = 2;
        D = 0;
        E = new Random();
        m = false;
        x = false;
        l = false;
        a = false;
        A = false;
        j = false;
        q = false;
        F = false;
        p = false;
        n = false;
        e = false;
        i = false;
        I = false;
        b = a1;
    }

    public int c(int k)
    {
        int i1 = 0;
        if(k >= b.A[0] && k < b.A[0] + 280)
            i1 = 0;
        else
        if(k >= b.A[1] && k < b.A[1] + 280)
            i1 = 1;
        return i1;
    }

    public boolean n()
    {
        v = 1;
        q();
        if(b.c(this))
            return false;
        if(d() <= 0)
        {
            return false;
        } else
        {
            a(d() - j());
            return true;
        }
    }

    public boolean l()
    {
        v = 0;
        q();
        if(b.c(this))
            return false;
        if(!b.c() && d() >= 80 || d() + h() >= 175)
        {
            return false;
        } else
        {
            a(d() + j());
            return true;
        }
    }

    public boolean j(int k)
    {
        if(f() <= 0)
        {
            return false;
        } else
        {
            g(f() + k);
            return true;
        }
    }

    public boolean b()
    {
        if(b.b(this))
            return true;
        if(f() <= 2)
        {
            return true;
        } else
        {
            g(f() + 2);
            return false;
        }
    }

    public void q()
    {
        u++;
        if(u >= d)
            u = 0;
    }

    public int g()
    {
        return u;
    }

    public int m()
    {
        return v;
    }

    public void h(int k)
    {
        v = k;
    }

    public void a(int k)
    {
        c = k;
    }

    public void g(int k)
    {
        f = k;
    }

    public int d()
    {
        return c;
    }

    public int f()
    {
        return f;
    }

    public void f(int k)
    {
        z = k;
    }

    public int o()
    {
        return z;
    }

    public void d(int k)
    {
        C = k;
    }

    public int j()
    {
        return C;
    }

    public void e(int k)
    {
        o = k;
    }

    public int r()
    {
        return o;
    }

    public void i(int k)
    {
        G = k;
    }

    public int h()
    {
        return G;
    }

    public void a(boolean flag)
    {
        e = flag;
        B = 0;
    }

    public int i()
    {
        return E.nextInt() & 0x7fffffff;
    }
}