Ejemplo n.º 1
0
        public static void Blit(LogicIntArray2 s, LogicIntArray2 d, int dX, int dY)
        {
            Debugger.doAssert(d != null, "blit Destination null");
            Debugger.doAssert(s != null, "blit Source null");

            Blit(s, 0, 0, s.width, s.height, d, dX, dY);
        }
Ejemplo n.º 2
0
 public static void FillRect(int width, int height, int value, LogicIntArray2 d, int dX, int dY)
 {
     for (int y = 0; y < height; ++y)
     {
         for (int x = 0; x < width; ++x)
         {
             d.Set(dX + x, dY + y, value);
         }
     }
 }
Ejemplo n.º 3
0
 public static void DebugPrint(LogicIntArray2 a)
 {
     for (int y = 0; y < a.height; ++y)
     {
         string str = "";
         for (int x = 0; x < a.width; ++x)
         {
             str += string.Format("{0},", a.Get(x, y));
         }
         Debugger.print(str);
     }
 }
Ejemplo n.º 4
0
        public static string ToString(LogicIntArray2 a)
        {
            string str = "";

            for (int y = 0; y < a.height; ++y)
            {
                for (int x = 0; x < a.width; ++x)
                {
                    str += string.Format("{0},", a.Get(x, y));
                }
                str += "\n";
            }
            return(str);
        }
Ejemplo n.º 5
0
        public static void Blit(LogicIntArray2 s, int sX, int sY, int width, int height, LogicIntArray2 d, int dX, int dY)
        {
            Debugger.doAssert(d != null, "blit Destination null");
            Debugger.doAssert(s != null, "blit Source null");

            switch (GetBlitMethod())
            {
            case BlitMethod.Add:
            {
                for (int y = 0; y < height; ++y)
                {
                    for (int x = 0; x < width; ++x)
                    {
                        int value = s.Get(sX + x, sY + y) + d.Get(dX + x, dY + y);
                        d.Set(dX + x, dY + y, value);
                    }
                }
            }
            break;

            case BlitMethod.Multiply:
            {
                for (int y = 0; y < height; ++y)
                {
                    for (int x = 0; x < width; ++x)
                    {
                        int value = s.Get(sX + x, sY + y) * d.Get(dX + x, dY + y);
                        d.Set(dX + x, dY + y, value);
                    }
                }
            }
            break;

            case BlitMethod.Replace:
            default:
            {
                for (int y = 0; y < height; ++y)
                {
                    for (int x = 0; x < width; ++x)
                    {
                        int value = s.Get(sX + x, sY + y);
                        d.Set(dX + x, dY + y, value);
                    }
                }
            }
            break;
            }
        }
Ejemplo n.º 6
0
        public static bool FindClosest(LogicIntArray2 needle, LogicIntArray2 haystack, LogicPoint2 start, LogicPoint2 closest)
        {
            Debugger.doAssert(needle != null, "findClosest needle null");
            Debugger.doAssert(haystack != null, "blit haystack null");
            Debugger.doAssert(start != null, "findClosest start null");
            Debugger.doAssert(closest != null, "blit closest null");

            int dWidth  = haystack.width - needle.width;
            int dHeight = haystack.height - needle.height;

            int distMin = int.MaxValue;

            for (int y = 0; y <= dHeight; ++y)
            {
                for (int x = 0; x <= dWidth; ++x)
                {
                    int dx   = x - start.x;
                    int dy   = y - start.y;
                    int dist = dx * dx + dy * dy;

                    if (dist < distMin)
                    {
                        bool equal = true;
                        for (int h = 0; h < needle.height && equal; ++h)
                        {
                            for (int w = 0; w < needle.width && equal; ++w)
                            {
                                equal = haystack.Get(x + w, y + h) == needle.Get(w, h);
                            }
                        }

                        if (equal)
                        {
                            distMin   = dist;
                            closest.x = x;
                            closest.y = y;
                        }
                    }
                }
            }
            return(distMin < int.MaxValue);
        }