c.java

二维QR条码项目的J2ME源代码。软件包括1.核心QR码编/解库

// Decompiled by DJ v3.9.9.91 Copyright 2005 Atanas Neshkov  Date: 12/6/2006 9:53:15 AM
// Home Page : http://members.fortunecity.com/neshkov/dj.html  - Check often for new version!
// Decompiler options: packimports(3) 

package jp.sourceforge.qrcode.geom;

import jp.sourceforge.qrcode.util.a;

// Referenced classes of package jp.sourceforge.qrcode.geom:
//            a

public final class c
{

    public c()
    {
        a = 0;
        b = 0;
        c = 0;
        d = 0;
    }

    public c(int i, int j, int k, int l)
    {
        a = i;
        b = j;
        c = k;
        d = l;
    }

    public c(jp.sourceforge.qrcode.geom.a a1, jp.sourceforge.qrcode.geom.a a2)
    {
        a = a1.a;
        b = a1.b;
        c = a2.a;
        d = a2.b;
    }

    public final jp.sourceforge.qrcode.geom.a a()
    {
        return new jp.sourceforge.qrcode.geom.a(a, b);
    }

    public final jp.sourceforge.qrcode.geom.a b()
    {
        return new jp.sourceforge.qrcode.geom.a(c, d);
    }

    public static boolean a(c c1, c c2)
    {
        return Math.abs(c1.a - c2.a) < 2 && Math.abs(c1.b - c2.b) < 2 && Math.abs(c1.c - c2.c) < 2 && Math.abs(c1.d - c2.d) < 2;
    }

    public final boolean c()
    {
        return b == d;
    }

    private boolean f()
    {
        return a == c;
    }

    public static boolean b(c c1, c c2)
    {
        if(c1.c() && c2.f())
        {
            if(c1.b > c2.b && c1.b < c2.d && c2.a > c1.a && c2.a < c1.c)
                return true;
        } else
        if(c1.f() && c2.c() && c1.a > c2.a && c1.a < c2.c && c2.b > c1.b && c2.b < c1.d)
            return true;
        return false;
    }

    public final jp.sourceforge.qrcode.geom.a d()
    {
        int i = (a + c) / 2;
        int j = (b + d) / 2;
        return new jp.sourceforge.qrcode.geom.a(i, j);
    }

    public final int e()
    {
        int i = Math.abs(c - a);
        int j = Math.abs(d - b);
        int k;
        return k = jp.sourceforge.qrcode.util.a.a(i * i + j * j);
    }

    public static c a(c ac[])
    {
        c c1 = new c();
        for(int i = 0; i < ac.length; i++)
            if(ac[i].e() > c1.e())
                c1 = ac[i];

        return c1;
    }

    public final String toString()
    {
        return "(" + Integer.toString(a) + "," + Integer.toString(b) + ")-(" + Integer.toString(c) + "," + Integer.toString(d) + ")";
    }

    public int a;
    public int b;
    public int c;
    public int d;
}