* src/cursor.C

[lyx.git] / src / cursor.C

diff --git a/src/cursor.C b/src/cursor.C
index de6463b518eb7b826d9b894eaaaec5f68ef98498..a7fb543984224de44319a7c642fad6edb8a82205 100644 (file)
--- a/src/cursor.C
+++ b/src/cursor.C
@@ -97,7 +97,12 @@ namespace {
                for (size_t i = 0; ; ++i) {
                        int xo;
                        int yo;
-                       it.inset().cursorPos(it.top(), c.boundary() && ((i+1) == it.depth()), xo, yo);
+                       InsetBase const * inset = &it.inset();
+                       Point o = theCoords.getInsets().xy(inset);
+                       inset->cursorPos(it.top(), c.boundary(), xo, yo);
+                       // Convert to absolute
+                       xo += o.x_;
+                       yo += o.y_;
                        double d = (x - xo) * (x - xo) + (y - yo) * (y - yo);
                        // '<=' in order to take the last possible position
                        // this is important for clicking behind \sum in e.g. '\sum_i a'
@@ -122,16 +127,26 @@ namespace {
                BOOST_ASSERT(!cursor.empty());
                InsetBase & inset = cursor[0].inset();
 
-               DocIterator it = doc_iterator_begin(inset);
-               DocIterator const et = doc_iterator_end(inset);
+               CoordCache::InnerParPosCache const & cache = theCoords.getParPos().find(cursor.bottom().text())->second;
+               // Get an iterator on the first paragraph in the cache
+               DocIterator it(inset);
+               it.push_back(CursorSlice(inset));
+               it.pit() = cache.begin()->first;
+               // Get an iterator after the last paragraph in the cache
+               DocIterator et(inset);
+               et.push_back(CursorSlice(inset));
+               et.pit() = boost::prior(cache.end())->first;
+               if (et.pit() >= et.lastpit())
+                       et = doc_iterator_end(inset);
+               else 
+                       ++et.pit();
 
                double best_dist = std::numeric_limits<double>::max();;
                DocIterator best_cursor = et;
 
                for ( ; it != et; it.forwardPos(true)) {
                        // avoid invalid nesting when selecting
-                       if (bv_funcs::status(&cursor.bv(), it) == bv_funcs::CUR_INSIDE
-                           && (!cursor.selection() || positionable(it, cursor.anchor_))) {
+                       if (!cursor.selection() || positionable(it, cursor.anchor_)) {
                                Point p = bv_funcs::getPos(it, false);
                                int xo = p.x_;
                                int yo = p.y_;
@@ -142,7 +157,7 @@ namespace {
                                        // '<=' in order to take the last possible position
                                        // this is important for clicking behind \sum in e.g. '\sum_i a'
                                        if (d <= best_dist) {
-                                               lyxerr << "*" << endl;
+                                               //      lyxerr << "*" << endl;
                                                best_dist   = d;
                                                best_cursor = it;
                                        }
@@ -374,13 +389,6 @@ void LCursor::getPos(int & x, int & y) const
 }
 
 
-void LCursor::paste(string const & data)
-{
-       if (!data.empty())
-               dispatch(FuncRequest(LFUN_PASTE, data));
-}
-
-
 void LCursor::resetAnchor()
 {
        anchor_ = *this;
@@ -707,7 +715,10 @@ void LCursor::niceInsert(MathAtom const & t)
                // be careful here: don't use 'pushLeft(t)' as this we need to
                // push the clone, not the original
                pushLeft(*nextInset());
-               paste(safe);
+               // We may not use niceInsert here (recursion)
+               MathArray ar;
+               asArray(safe, ar);
+               insert(ar);
        }
 }