1 files changed, 260 insertions, 0 deletions

diff --git a/dw/types.cc b/dw/types.cc
new file mode 100644
index 00000000..94f95b42
--- /dev/null
+++ b/dw/types.cc
@@ -0,0 +1,260 @@
+/*
+ * Dillo Widget
+ *
+ * Copyright 2005-2007 Sebastian Geerken <sgeerken@dillo.org>
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ */
+
+
+
+#include "core.hh"
+
+namespace dw {
+namespace core {
+
+Rectangle::Rectangle (int x, int y, int width, int height)
+{
+   this->x = x;
+   this->y = y;
+   this->width = width;
+   this->height = height;
+}
+
+/**
+ * Return whether this rectangle and otherRect intersect. If yes,
+ * return the intersection rectangle in dest.
+ *
+ * \todo The function has been copied from gdktrectangle.c. Is this relevant
+ *       for copyright?
+ */
+bool Rectangle::intersectsWith (Rectangle *otherRect, Rectangle *dest)
+{
+   Rectangle *src1 = this, *src2 = otherRect, *temp;
+   int src1_x2, src1_y2;
+   int src2_x2, src2_y2;
+   bool return_val;
+
+   return_val = false;
+
+   if (src2->x < src1->x) {
+      temp = src1;
+      src1 = src2;
+      src2 = temp;
+   }
+   dest->x = src2->x;
+
+   src1_x2 = src1->x + src1->width;
+   src2_x2 = src2->x + src2->width;
+
+   if (src2->x < src1_x2) {
+      if (src1_x2 < src2_x2)
+         dest->width = src1_x2 - dest->x;
+      else
+         dest->width = src2_x2 - dest->x;
+
+      if (src2->y < src1->y) {
+         temp = src1;
+         src1 = src2;
+         src2 = temp;
+      }
+      dest->y = src2->y;
+
+      src1_y2 = src1->y + src1->height;
+      src2_y2 = src2->y + src2->height;
+
+      if (src2->y < src1_y2) {
+         return_val = true;
+
+         if (src1_y2 < src2_y2)
+            dest->height = src1_y2 - dest->y;
+         else
+            dest->height = src2_y2 - dest->y;
+
+         if (dest->height == 0)
+            return_val = false;
+         if (dest->width == 0)
+            return_val = false;
+      }
+   }
+
+   return return_val;
+}
+
+/*
+ * Return whether this is a subset of otherRect.
+ */
+bool Rectangle::isSubsetOf (Rectangle *otherRect)
+{
+   return
+      x >= otherRect->x &&
+      y >= otherRect->y &&
+      x + width <= otherRect->x + otherRect->width &&
+      y + height <= otherRect->y + otherRect->height;
+}
+
+bool Rectangle::isPointWithin (int x, int y)
+{
+   return
+      x >= this->x && y >= this->y &&
+      x < this->x + width && y < this->y + height;
+}
+
+// ----------------------------------------------------------------------
+
+Circle::Circle (int x, int y, int radius)
+{
+   this->x = x;
+   this->y = y;
+   this->radius = radius;
+}
+
+bool Circle::isPointWithin (int x, int y)
+{
+   return
+      (x - this->x) * (x - this->x) + (y - this->y) * (y - this->y)
+      <= radius * radius;
+}
+
+// ----------------------------------------------------------------------
+
+Polygon::Polygon ()
+{
+   points = new misc::SimpleVector<Point> (8);
+   minx = miny = 0xffffff;
+   maxx = maxy = -0xffffff;
+}
+
+Polygon::~Polygon ()
+{
+   delete points;
+}
+
+void Polygon::addPoint (int x, int y)
+{
+   points->increase ();
+   points->getRef(points->size () - 1)->x = x;
+   points->getRef(points->size () - 1)->y = y;
+
+   minx = misc::min(minx, x);
+   miny = misc::min(miny, y);
+   maxx = misc::max(maxx, x);
+   maxy = misc::max(maxy, y);
+}
+
+/**
+ * \brief Return, whether the line, limited by (ax1, ay1) and (ax2, ay2),
+ *    crosses the unlimited line, determined by two points (bx1, by1) and
+ *    (bx2, by2).
+ */
+bool Polygon::linesCross0(int ax1, int ay1, int ax2, int ay2,
+                          int bx1, int by1, int bx2, int by2)
+{
+   /** TODO Some more description */
+   // If the scalar product is 0, it means that one point is on the second
+   // line, so we check for <= 0, not < 0.
+   return
+      zOfVectorProduct (ax1 - bx1, ay1 - by1, bx2 - bx1, by2 - by1) *
+      zOfVectorProduct (ax2 - bx1, ay2 - by1, bx2 - bx1, by2 - by1) <= 0;
+}
+
+/**
+ * \brief Return, whether the line, limited by (ax1, ay1) and (ax2, ay2),
+ *    crosses the line, limited by (bx1, by1) and (bx2, by2).
+ */
+bool Polygon::linesCross(int ax1, int ay1, int ax2, int ay2,
+                         int bx1, int by1, int bx2, int by2)
+{
+   bool cross =
+      linesCross0 (ax1, ay1, ax2, ay2, bx1, by1, bx2, by2) &&
+      linesCross0 (bx1, by1, bx2, by2, ax1, ay1, ax2, ay2);
+   //printf ("(%d, %d) - (%d, %d) and (%d, %d) - (%d, %d) cross? %s.\n",
+   //        ax1, ay1, ax2, ay2, bx1, by1, bx2, by2, cross ? "Yes" : "No");
+   return cross;
+}
+
+bool Polygon::isPointWithin (int x, int y)
+{
+   if (points->size () < 3 ||
+       (x < minx || x > maxx || y < miny || y >= maxy))
+      return false;
+   else {
+      int numCrosses = 0;
+      for (int i = 0; i < points->size () - 1; i++) {
+         if (linesCross (minx - 1, miny - 1, x, y,
+                         points->getRef(i)->x, points->getRef(i)->y,
+                         points->getRef(i + 1)->x, points->getRef(i + 1)->y))
+            numCrosses++;
+      }
+      if (linesCross (minx - 1, miny - 1, x, y,
+                      points->getRef(points->size () - 1)->x,
+                      points->getRef(points->size () - 1)->y,
+                      points->getRef(0)->x, points->getRef(0)->y))
+         numCrosses++;
+
+      return numCrosses % 2 == 1;
+   }
+}
+
+Region::Region()
+{
+   rectangleList = new container::typed::List <Rectangle> (true);
+}
+
+Region::~Region()
+{
+   delete rectangleList;
+}
+
+/**
+ * \brief Add a rectangle to the region and combine it with
+ * existing rectangles if possible.
+ * The number of rectangles is forced to be less than 16
+ * by combining excessive rectangles.
+ */
+void Region::addRectangle (Rectangle *rPointer)
+{
+   container::typed::Iterator <Rectangle> it;
+   Rectangle *r = new Rectangle (rPointer->x, rPointer->y,
+      rPointer->width, rPointer->height);
+
+   for (it = rectangleList->iterator (); it.hasNext (); ) {
+      Rectangle *ownRect = it.getNext ();
+
+      int combinedHeight =
+         misc::max(r->y + r->height, ownRect->y + ownRect->height) -
+         misc::min(r->y, ownRect->y);
+      int combinedWidth =
+         misc::max(r->x + r->width, ownRect->x + ownRect->width) -
+         misc::min(r->x, ownRect->x);
+
+      if (rectangleList->size() >= 16 ||
+         combinedWidth * combinedHeight <=
+         ownRect->width * ownRect->height + r->width * r->height) {
+
+            r->x = misc::min(r->x, ownRect->x);
+            r->y = misc::min(r->y, ownRect->y);
+            r->width = combinedWidth;
+            r->height = combinedHeight;
+            
+            rectangleList->removeRef (ownRect);
+      }
+   }
+
+   rectangleList->append (r);
+}
+
+} // namespace dw
+} // namespace core