listerrors.lyx : Update a link.

[lyx.git] / src / CoordCache.h

diff --git a/src/CoordCache.h b/src/CoordCache.h
index 2b63e6d340a2c5430c45c217355aa28febe62792..99d31a9280156173f4748683203f205bd27f0a0f 100644 (file)
--- a/src/CoordCache.h
+++ b/src/CoordCache.h
@@ -3,7 +3,7 @@
  * This file is part of LyX, the document processor.
  * Licence details can be found in the file COPYING.
  *
- * \author André Pönitz
+ * \author André Pönitz
  *
  * Full author contact details are available in file CREDITS.
  */
@@ -29,18 +29,6 @@ class Paragraph;
 
 void lyxbreaker(void const * data, const char * hint, int size);
 
-class Point {
-public:
-       Point()
-               : x_(0), y_(0)
-       {}
-
-       Point(int x, int y);
-
-       int x_, y_;
-};
-
-
 struct Geometry {
        Point pos;
        Dimension dim;
@@ -52,6 +40,25 @@ struct Geometry {
                        && y >= pos.y_ - dim.asc
                        && y <= pos.y_ + dim.des;
        }
+
+       int squareDistance(int x, int y) const
+       {
+               int xx = 0;
+               int yy = 0;
+
+               if (x < pos.x_)
+                       xx = pos.x_ - x;
+               else if (x > pos.x_ + dim.wid)
+                       xx = x - pos.x_ - dim.wid;
+
+               if (y < pos.y_ - dim.asc)
+                       yy = pos.y_ - dim.asc - y;
+               else if (y > pos.y_ + dim.des)
+                       yy = y - pos.y_ - dim.des;
+
+               // Optimisation: We avoid to compute the sqrt on purpose.
+               return xx*xx + yy*yy;
+       }
 };
 
 
@@ -74,12 +81,20 @@ public:
 
        void add(T const * thing, Dimension const & dim)
        {
+               if (!has(thing))
+                       data_[thing].pos = Point(-10000, -10000);
                data_[thing].dim = dim;
        }
 
+       Geometry const & geometry(T const * thing) const
+       {
+               check(thing, "geometry");
+               return data_.find(thing)->second;
+       }
+
        Dimension const & dim(T const * thing) const
        {
-               check(thing, "dim");
+               checkDim(thing, "dim");
                return data_.find(thing)->second.dim;
        }
 
@@ -102,19 +117,42 @@ public:
        }
 
        bool has(T const * thing) const
+       {
+               typename cache_type::const_iterator it = data_.find(thing);
+
+               if (it == data_.end())
+                       return false;
+               return it->second.pos.x_ != -10000;
+       }
+
+       bool hasDim(T const * thing) const
        {
                return data_.find(thing) != data_.end();
        }
 
        bool covers(T const * thing, int x, int y) const
        {
-               cache_type::const_iterator it = data_.find(thing);
+               typename cache_type::const_iterator it = data_.find(thing);
                return it != data_.end() && it->second.covers(x, y);
        }
 
+       int squareDistance(T const * thing, int x, int y) const
+       {
+               typename cache_type::const_iterator it = data_.find(thing);
+               if (it == data_.end())
+                       return 1000000;
+               return it->second.squareDistance(x, y);
+       }
+
 private:
        friend class CoordCache;
 
+       void checkDim(T const * thing, char const * hint) const
+       {
+               if (!hasDim(thing))
+                       lyxbreaker(thing, hint, data_.size());
+       }
+
        void check(T const * thing, char const * hint) const
        {
                if (!has(thing))
@@ -123,9 +161,6 @@ private:
 
        typedef std::map<T const *, Geometry> cache_type;
        cache_type data_;
-
-public:
-       cache_type const & getData() const { return data_; }
 };
 
 /**