3 * This file is part of LyX, the document processor.
4 * Licence details can be found in the file COPYING.
6 * \author Alejandro Aguilar Sierra
7 * \author Alfredo Braunstein
10 * Full author contact details are available in file CREDITS.
15 #include "BufferView.h"
16 #include "bufferview_funcs.h"
19 #include "coordcache.h"
20 #include "CutAndPaste.h"
22 #include "dispatchresult.h"
24 #include "funcrequest.h"
28 #include "lyxfunc.h" // only for setMessage()
32 #include "paragraph.h"
33 #include "paragraph_funcs.h"
34 #include "pariterator.h"
36 #include "insets/insettabular.h"
37 #include "insets/insettext.h"
39 #include "mathed/MathData.h"
40 #include "mathed/InsetMath.h"
41 #include "mathed/InsetMathScript.h"
42 #include "mathed/MathMacroTable.h"
44 #include "support/limited_stack.h"
46 #include <boost/assert.hpp>
47 #include <boost/bind.hpp>
48 #include <boost/current_function.hpp>
59 #ifndef CXX_GLOBAL_CSTD
68 positionable(DocIterator const & cursor, DocIterator const & anchor)
70 // avoid deeper nested insets when selecting
71 if (cursor.depth() > anchor.depth())
74 // anchor might be deeper, should have same path then
75 for (size_t i = 0; i < cursor.depth(); ++i)
76 if (&cursor[i].inset() != &anchor[i].inset())
79 // position should be ok.
84 // Find position closest to (x, y) in cell given by iter.
85 // Used only in mathed
86 DocIterator bruteFind2(LCursor const & c, int x, int y)
88 double best_dist = std::numeric_limits<double>::max();
95 et.top().pos() = et.top().asInsetMath()->cell(et.top().idx()).size();
96 for (size_t i = 0; ; ++i) {
99 InsetBase const * inset = &it.inset();
100 std::map<InsetBase const *, Point> const & data =
101 c.bv().coordCache().getInsets().getData();
102 std::map<InsetBase const *, Point>::const_iterator I = data.find(inset);
104 // FIXME: in the case where the inset is not in the cache, this
105 // means that no part of it is visible on screen. In this case
106 // we don't do elaborate search and we just return the forwarded
107 // DocIterator at its beginning.
108 if (I == data.end()) {
114 inset->cursorPos(c.bv(), it.top(), c.boundary(), xo, yo);
115 // Convert to absolute
118 double d = (x - xo) * (x - xo) + (y - yo) * (y - yo);
119 // '<=' in order to take the last possible position
120 // this is important for clicking behind \sum in e.g. '\sum_i a'
121 lyxerr[Debug::DEBUG] << "i: " << i << " d: " << d
122 << " best: " << best_dist << endl;
123 if (d <= best_dist) {
135 /// moves position closest to (x, y) in given box
136 bool bruteFind(LCursor & cursor,
137 int x, int y, int xlow, int xhigh, int ylow, int yhigh)
139 BOOST_ASSERT(!cursor.empty());
140 InsetBase & inset = cursor[0].inset();
141 BufferView & bv = cursor.bv();
143 CoordCache::InnerParPosCache const & cache =
144 bv.coordCache().getParPos().find(cursor.bottom().text())->second;
145 // Get an iterator on the first paragraph in the cache
146 DocIterator it(inset);
147 it.push_back(CursorSlice(inset));
148 it.pit() = cache.begin()->first;
149 // Get an iterator after the last paragraph in the cache
150 DocIterator et(inset);
151 et.push_back(CursorSlice(inset));
152 et.pit() = boost::prior(cache.end())->first;
153 if (et.pit() >= et.lastpit())
154 et = doc_iterator_end(inset);
158 double best_dist = std::numeric_limits<double>::max();;
159 DocIterator best_cursor = et;
161 for ( ; it != et; it.forwardPos(true)) {
162 // avoid invalid nesting when selecting
163 if (!cursor.selection() || positionable(it, cursor.anchor_)) {
164 Point p = bv_funcs::getPos(bv, it, false);
167 if (xlow <= xo && xo <= xhigh && ylow <= yo && yo <= yhigh) {
168 double const dx = xo - x;
169 double const dy = yo - y;
170 double const d = dx * dx + dy * dy;
171 // '<=' in order to take the last possible position
172 // this is important for clicking behind \sum in e.g. '\sum_i a'
173 if (d <= best_dist) {
174 // lyxerr << "*" << endl;
182 if (best_cursor != et) {
183 cursor.setCursor(best_cursor);
191 /// moves position closest to (x, y) in given box
192 bool bruteFind3(LCursor & cur, int x, int y, bool up)
194 BufferView & bv = cur.bv();
195 int ylow = up ? 0 : y + 1;
196 int yhigh = up ? y - 1 : bv.workHeight();
198 int xhigh = bv.workWidth();
200 // FIXME: bit more work needed to get 'from' and 'to' right.
201 pit_type from = cur.bottom().pit();
202 //pit_type to = cur.bottom().pit();
203 //lyxerr << "Pit start: " << from << endl;
205 //lyxerr << "bruteFind3: x: " << x << " y: " << y
206 // << " xlow: " << xlow << " xhigh: " << xhigh
207 // << " ylow: " << ylow << " yhigh: " << yhigh
209 InsetBase & inset = bv.buffer()->inset();
210 DocIterator it = doc_iterator_begin(inset);
212 DocIterator et = doc_iterator_end(inset);
214 double best_dist = std::numeric_limits<double>::max();
215 DocIterator best_cursor = et;
217 for ( ; it != et; it.forwardPos()) {
218 // avoid invalid nesting when selecting
219 if (bv_funcs::status(&bv, it) == bv_funcs::CUR_INSIDE
220 && (!cur.selection() || positionable(it, cur.anchor_))) {
221 Point p = bv_funcs::getPos(bv, it, false);
224 if (xlow <= xo && xo <= xhigh && ylow <= yo && yo <= yhigh) {
225 double const dx = xo - x;
226 double const dy = yo - y;
227 double const d = dx * dx + dy * dy;
228 //lyxerr << "itx: " << xo << " ity: " << yo << " d: " << d
229 // << " dx: " << dx << " dy: " << dy
230 // << " idx: " << it.idx() << " pos: " << it.pos()
233 // '<=' in order to take the last possible position
234 // this is important for clicking behind \sum in e.g. '\sum_i a'
235 if (d <= best_dist) {
236 //lyxerr << "*" << endl;
244 //lyxerr << "best_dist: " << best_dist << " cur:\n" << best_cursor << endl;
245 if (best_cursor == et)
247 cur.setCursor(best_cursor);
254 // be careful: this is called from the bv's constructor, too, so
255 // bv functions are not yet available!
256 LCursor::LCursor(BufferView & bv)
257 : DocIterator(), bv_(&bv), anchor_(), x_target_(-1),
258 selection_(false), mark_(false), logicalpos_(false)
262 void LCursor::reset(InsetBase & inset)
265 push_back(CursorSlice(inset));
266 anchor_ = DocIterator(inset);
273 // this (intentionally) does neither touch anchor nor selection status
274 void LCursor::setCursor(DocIterator const & cur)
276 DocIterator::operator=(cur);
280 void LCursor::dispatch(FuncRequest const & cmd0)
282 lyxerr[Debug::DEBUG] << BOOST_CURRENT_FUNCTION
283 << " cmd: " << cmd0 << '\n'
289 FuncRequest cmd = cmd0;
290 LCursor safe = *this;
292 for (; depth(); pop()) {
293 lyxerr[Debug::DEBUG] << "LCursor::dispatch: cmd: "
294 << cmd0 << endl << *this << endl;
295 BOOST_ASSERT(pos() <= lastpos());
296 BOOST_ASSERT(idx() <= lastidx());
297 BOOST_ASSERT(pit() <= lastpit());
299 // The common case is 'LFUN handled, need update', so make the
300 // LFUN handler's life easier by assuming this as default value.
301 // The handler can reset the update and val flags if necessary.
302 disp_.update(Update::FitCursor | Update::Force);
303 disp_.dispatched(true);
304 inset().dispatch(*this, cmd);
305 if (disp_.dispatched())
308 // it completely to get a 'bomb early' behaviour in case this
309 // object will be used again.
310 if (!disp_.dispatched()) {
311 lyxerr[Debug::DEBUG] << "RESTORING OLD CURSOR!" << endl;
313 disp_.update(Update::None);
314 disp_.dispatched(false);
319 DispatchResult LCursor::result() const
325 BufferView & LCursor::bv() const
332 Buffer & LCursor::buffer() const
335 BOOST_ASSERT(bv_->buffer());
336 return *bv_->buffer();
342 BOOST_ASSERT(depth() >= 1);
347 void LCursor::push(InsetBase & p)
349 push_back(CursorSlice(p));
353 void LCursor::pushLeft(InsetBase & p)
355 BOOST_ASSERT(!empty());
356 //lyxerr << "Entering inset " << t << " left" << endl;
362 bool LCursor::popLeft()
364 BOOST_ASSERT(!empty());
365 //lyxerr << "Leaving inset to the left" << endl;
366 inset().notifyCursorLeaves(*this);
374 bool LCursor::popRight()
376 BOOST_ASSERT(!empty());
377 //lyxerr << "Leaving inset to the right" << endl;
378 const pos_type lp = (depth() > 1) ? (*this)[depth() - 2].lastpos() : 0;
379 inset().notifyCursorLeaves(*this);
383 pos() += lastpos() - lp + 1;
388 int LCursor::currentMode()
390 BOOST_ASSERT(!empty());
391 for (int i = depth() - 1; i >= 0; --i) {
392 int res = operator[](i).inset().currentMode();
393 if (res != InsetBase::UNDECIDED_MODE)
396 return InsetBase::TEXT_MODE;
400 void LCursor::getPos(int & x, int & y) const
402 Point p = bv_funcs::getPos(bv(), *this, boundary());
408 Row const & LCursor::textRow() const
410 ParagraphMetrics const & pm = bv().parMetrics(text(), pit());
411 BOOST_ASSERT(!pm.rows().empty());
412 return pm.getRow(pos(), boundary());
416 void LCursor::resetAnchor()
423 bool LCursor::posLeft()
432 bool LCursor::posRight()
434 if (pos() == lastpos())
441 CursorSlice LCursor::anchor() const
443 BOOST_ASSERT(anchor_.depth() >= depth());
444 CursorSlice normal = anchor_[depth() - 1];
445 if (depth() < anchor_.depth() && top() <= normal) {
446 // anchor is behind cursor -> move anchor behind the inset
453 CursorSlice LCursor::selBegin() const
457 return anchor() < top() ? anchor() : top();
461 CursorSlice LCursor::selEnd() const
465 return anchor() > top() ? anchor() : top();
469 DocIterator LCursor::selectionBegin() const
473 DocIterator di = (anchor() < top() ? anchor_ : *this);
479 DocIterator LCursor::selectionEnd() const
483 DocIterator di = (anchor() > top() ? anchor_ : *this);
484 if (di.depth() > depth()) {
492 void LCursor::setSelection()
495 // A selection with no contents is not a selection
497 #warning doesnt look ok
499 if (pit() == anchor().pit() && pos() == anchor().pos())
504 void LCursor::setSelection(DocIterator const & where, int n)
513 void LCursor::setSelection(DocIterator const & from,
514 DocIterator const & to)
522 void LCursor::clearSelection()
530 int & LCursor::x_target()
536 int LCursor::x_target() const
542 void LCursor::clearTargetX()
549 void LCursor::info(odocstream & os) const
551 for (int i = 1, n = depth(); i < n; ++i) {
552 operator[](i).inset().infoize(os);
556 InsetBase const * inset = prevInset();
557 // prevInset() can return 0 in certain case.
559 prevInset()->infoize2(os);
561 // overwite old message
566 bool LCursor::selHandle(bool sel)
568 //lyxerr << "LCursor::selHandle" << endl;
569 if (sel == selection())
574 cap::saveSelection(*this);
579 std::ostream & operator<<(std::ostream & os, LCursor const & cur)
581 os << "\n cursor: | anchor:\n";
582 for (size_t i = 0, n = cur.depth(); i != n; ++i) {
583 os << " " << cur[i] << " | ";
584 if (i < cur.anchor_.depth())
585 os << cur.anchor_[i];
587 os << "-------------------------------";
590 for (size_t i = cur.depth(), n = cur.anchor_.depth(); i < n; ++i) {
591 os << "------------------------------- | " << cur.anchor_[i] << "\n";
593 os << " selection: " << cur.selection_
594 << " x_target: " << cur.x_target_ << endl;
601 ///////////////////////////////////////////////////////////////////
603 // The part below is the non-integrated rest of the original math
604 // cursor. This should be either generalized for texted or moved
605 // back to mathed (in most cases to InsetMathNest).
607 ///////////////////////////////////////////////////////////////////
609 #include "mathed/InsetMathChar.h"
610 #include "mathed/InsetMathGrid.h"
611 #include "mathed/InsetMathScript.h"
612 #include "mathed/InsetMathUnknown.h"
613 #include "mathed/MathFactory.h"
614 #include "mathed/MathMacroArgument.h"
615 #include "mathed/MathStream.h"
616 #include "mathed/MathSupport.h"
621 //#define FILEDEBUG 1
624 bool LCursor::isInside(InsetBase const * p)
626 for (size_t i = 0; i != depth(); ++i)
627 if (&operator[](i).inset() == p)
633 void LCursor::leaveInset(InsetBase const & inset)
635 for (size_t i = 0; i != depth(); ++i) {
636 if (&operator[](i).inset() == &inset) {
644 bool LCursor::openable(MathAtom const & t) const
655 // we can't move into anything new during selection
656 if (depth() >= anchor_.depth())
658 if (!ptr_cmp(t.nucleus(), &anchor_[depth()].inset()))
665 void LCursor::setScreenPos(int x, int y)
668 bruteFind(*this, x, y, 0, bv().workWidth(), 0, bv().workHeight());
673 void LCursor::plainErase()
679 void LCursor::markInsert()
681 insert(char_type(0));
685 void LCursor::markErase()
691 void LCursor::plainInsert(MathAtom const & t)
693 cell().insert(pos(), t);
698 void LCursor::insert(docstring const & str)
700 for_each(str.begin(), str.end(),
701 boost::bind(static_cast<void(LCursor::*)(char_type)>
702 (&LCursor::insert), this, _1));
706 void LCursor::insert(char_type c)
708 //lyxerr << "LCursor::insert char '" << c << "'" << endl;
709 BOOST_ASSERT(!empty());
711 cap::selClearOrDel(*this);
712 insert(new InsetMathChar(c));
714 text()->insertChar(*this, c);
719 void LCursor::insert(MathAtom const & t)
721 //lyxerr << "LCursor::insert MathAtom '" << t << "'" << endl;
723 cap::selClearOrDel(*this);
728 void LCursor::insert(InsetBase * inset)
731 insert(MathAtom(inset));
733 text()->insertInset(*this, inset);
737 void LCursor::niceInsert(docstring const & t)
748 void LCursor::niceInsert(MathAtom const & t)
751 docstring const safe = cap::grabAndEraseSelection(*this);
753 // enter the new inset and move the contents of the selection if possible
756 // be careful here: don't use 'pushLeft(t)' as this we need to
757 // push the clone, not the original
758 pushLeft(*nextInset());
759 // We may not use niceInsert here (recursion)
767 void LCursor::insert(MathArray const & ar)
771 cap::eraseSelection(*this);
772 cell().insert(pos(), ar);
777 bool LCursor::backspace()
779 autocorrect() = false;
782 cap::eraseSelection(*this);
787 // If empty cell, and not part of a big cell
788 if (lastpos() == 0 && inset().nargs() == 1) {
790 // Directly delete empty cell: [|[]] => [|]
796 // [|], can not delete from inside
806 InsetMathUnknown * p = activeMacro();
807 if (p->name().size() > 1) {
808 p->setName(p->name().substr(0, p->name().size() - 1));
813 if (pos() != 0 && prevAtom()->nargs() > 0) {
814 // let's require two backspaces for 'big stuff' and
815 // highlight on the first
827 bool LCursor::erase()
829 autocorrect() = false;
834 cap::eraseSelection(*this);
838 // delete empty cells if possible
839 if (pos() == lastpos() && inset().idxDelete(idx()))
842 // special behaviour when in last position of cell
843 if (pos() == lastpos()) {
844 bool one_cell = inset().nargs() == 1;
845 if (one_cell && lastpos() == 0) {
847 // Directly delete empty cell: [|[]] => [|]
853 // [|], can not delete from inside
858 inset().idxGlue(idx());
862 // 'clever' UI hack: only erase large items if previously slected
863 if (pos() != lastpos() && nextAtom()->nargs() > 0) {
878 DocIterator save = *this;
882 autocorrect() = false;
890 DocIterator save = *this;
894 autocorrect() = false;
899 bool LCursor::macroModeClose()
903 InsetMathUnknown * p = activeMacro();
905 docstring const s = p->name();
909 // do nothing if the macro name is empty
913 // prevent entering of recursive macros
914 // FIXME: this is only a weak attempt... only prevents immediate
916 docstring const name = s.substr(1);
917 InsetBase const * macro = innerInsetOfType(InsetBase::MATHMACRO_CODE);
918 if (macro && macro->getInsetName() == name)
919 lyxerr << "can't enter recursive macro" << endl;
921 InsetMathNest * const in = inset().asInsetMath()->asNestInset();
922 if (in && in->interpretString(*this, s))
924 plainInsert(createInsetMath(name));
929 docstring LCursor::macroName()
931 return inMacroMode() ? activeMacro()->name() : docstring();
935 void LCursor::handleNest(MathAtom const & a, int c)
937 //lyxerr << "LCursor::handleNest: " << c << endl;
939 asArray(cap::grabAndEraseSelection(*this), t.nucleus()->cell(c));
942 pushLeft(*nextInset());
946 int LCursor::targetX() const
948 if (x_target() != -1)
957 void LCursor::setTargetX()
966 bool LCursor::inMacroMode() const
970 InsetMathUnknown const * p = prevAtom()->asUnknownInset();
971 return p && !p->final();
975 InsetMathUnknown * LCursor::activeMacro()
977 return inMacroMode() ? prevAtom().nucleus()->asUnknownInset() : 0;
981 void LCursor::pullArg()
986 MathArray ar = cell();
987 if (popLeft() && inMathed()) {
989 cell().insert(pos(), ar);
992 //formula()->mutateToText();
997 void LCursor::touch()
1003 DocIterator::const_iterator it = begin();
1004 DocIterator::const_iterator et = end();
1005 for ( ; it != et; ++it)
1011 void LCursor::normalize()
1013 if (idx() > lastidx()) {
1014 lyxerr << "this should not really happen - 1: "
1015 << idx() << ' ' << nargs()
1016 << " in: " << &inset() << endl;
1020 if (pos() > lastpos()) {
1021 lyxerr << "this should not really happen - 2: "
1022 << pos() << ' ' << lastpos() << " in idx: " << idx()
1024 odocstringstream os;
1025 WriteStream wi(os, false, true);
1026 inset().asInsetMath()->write(wi);
1027 lyxerr << to_utf8(os.str()) << endl;
1033 bool LCursor::goUpDown(bool up)
1035 // Be warned: The 'logic' implemented in this function is highly
1036 // fragile. A distance of one pixel or a '<' vs '<=' _really
1037 // matters. So fiddle around with it only if you think you know
1038 // what you are doing!
1044 // check if we had something else in mind, if not, this is the future
1046 if (x_target() == -1)
1051 // try neigbouring script insets
1055 InsetMathScript const * p = prevAtom()->asScriptInset();
1056 if (p && p->has(up)) {
1058 push(*const_cast<InsetMathScript*>(p));
1059 idx() = p->idxOfScript(up);
1066 if (pos() != lastpos()) {
1067 InsetMathScript const * p = nextAtom()->asScriptInset();
1068 if (p && p->has(up)) {
1069 push(*const_cast<InsetMathScript*>(p));
1070 idx() = p->idxOfScript(up);
1077 // FIXME: Switch this on for more robust movement
1080 return bruteFind3(*this, xo, yo, up);
1083 //xarray().boundingBox(xlow, xhigh, ylow, yhigh);
1088 //if (bruteFind(*this, xo, yo, xlow, xhigh, ylow, yhigh)) {
1089 // lyxerr << "updown: handled by brute find in the same cell" << endl;
1093 // try to find an inset that knows better then we
1095 //lyxerr << "updown: We are in " << &inset() << " idx: " << idx() << endl;
1097 if (inset().idxUpDown(*this, up)) {
1098 //lyxerr << "idxUpDown triggered" << endl;
1099 // try to find best position within this inset
1101 setCursor(bruteFind2(*this, xo, yo));
1105 // no such inset found, just take something "above"
1107 //lyxerr << "updown: popleft failed (strange case)" << endl;
1108 int ylow = up ? 0 : yo + 1;
1109 int yhigh = up ? yo - 1 : bv().workHeight();
1110 return bruteFind(*this, xo, yo, 0, bv().workWidth(), ylow, yhigh);
1113 // any improvement so far?
1114 //lyxerr << "updown: popLeft succeeded" << endl;
1118 if (up ? ynew < yo : ynew > yo)
1122 // we should not come here.
1123 BOOST_ASSERT(false);
1128 void LCursor::handleFont(string const & font)
1130 lyxerr[Debug::DEBUG] << BOOST_CURRENT_FUNCTION << ": " << font << endl;
1134 safe = cap::grabAndEraseSelection(*this);
1137 if (lastpos() != 0) {
1138 // something left in the cell
1140 // cursor in first position
1142 } else if (pos() == lastpos()) {
1143 // cursor in last position
1146 // cursor in between. split cell
1147 MathArray::iterator bt = cell().begin();
1148 MathAtom at = createInsetMath(from_utf8(font));
1149 at.nucleus()->cell(0) = MathArray(bt, bt + pos());
1150 cell().erase(bt, bt + pos());
1155 // nothing left in the cell
1163 void LCursor::message(docstring const & msg) const
1165 theLyXFunc().setMessage(msg);
1169 void LCursor::errorMessage(docstring const & msg) const
1171 theLyXFunc().setErrorMessage(msg);
1175 docstring LCursor::selectionAsString(bool label) const
1181 Buffer const & buffer = *bv().buffer();
1182 ParagraphList const & pars = text()->paragraphs();
1184 // should be const ...
1185 pit_type startpit = selBegin().pit();
1186 pit_type endpit = selEnd().pit();
1187 size_t const startpos = selBegin().pos();
1188 size_t const endpos = selEnd().pos();
1190 if (startpit == endpit)
1191 return pars[startpit].asString(buffer, startpos, endpos, label);
1193 // First paragraph in selection
1194 docstring result = pars[startpit].
1195 asString(buffer, startpos, pars[startpit].size(), label) + "\n\n";
1197 // The paragraphs in between (if any)
1198 for (pit_type pit = startpit + 1; pit != endpit; ++pit) {
1199 Paragraph const & par = pars[pit];
1200 result += par.asString(buffer, 0, par.size(), label) + "\n\n";
1203 // Last paragraph in selection
1204 result += pars[endpit].asString(buffer, 0, endpos, label);
1210 return cap::grabSelection(*this);
1216 docstring LCursor::currentState()
1219 odocstringstream os;
1225 return text()->currentState(*this);
1231 docstring LCursor::getPossibleLabel()
1233 return inMathed() ? from_ascii("eq:") : text()->getPossibleLabel(*this);
1237 Encoding const * LCursor::getEncoding() const
1244 // go up until first non-0 text is hit
1245 // (innermost text is 0 in mathed)
1246 for (s = depth() - 1; s >= 0; --s)
1247 if (operator[](s).text())
1249 CursorSlice const & sl = operator[](s);
1250 LyXText const & text = *sl.text();
1251 LyXFont font = text.getPar(sl.pit()).getFont(
1252 bv().buffer()->params(), sl.pos(), outerFont(sl.pit(), text.paragraphs()));
1253 return font.language()->encoding();
1257 void LCursor::undispatched()
1259 disp_.dispatched(false);
1263 void LCursor::dispatched()
1265 disp_.dispatched(true);
1269 void LCursor::updateFlags(Update::flags f)
1275 void LCursor::noUpdate()
1277 disp_.update(Update::None);
1281 LyXFont LCursor::getFont() const
1283 // HACK. far from being perfect...
1285 // go up until first non-0 text is hit
1286 // (innermost text is 0 in mathed)
1287 for (s = depth() - 1; s >= 0; --s)
1288 if (operator[](s).text())
1290 CursorSlice const & sl = operator[](s);
1291 LyXText const & text = *sl.text();
1292 LyXFont font = text.getPar(sl.pit()).getFont(
1293 bv().buffer()->params(),
1295 outerFont(sl.pit(), text.paragraphs()));
1301 void LCursor::fixIfBroken()
1303 // find out last good level
1304 LCursor copy = *this;
1305 size_t newdepth = depth();
1306 while (!copy.empty()) {
1307 if (copy.idx() > copy.lastidx()) {
1308 lyxerr << "wrong idx " << copy.idx()
1309 << ", max is " << copy.lastidx()
1310 << " at level " << copy.depth()
1311 << ". Trying to correct this." << endl;
1312 newdepth = copy.depth() - 1;
1314 else if (copy.pit() > copy.lastpit()) {
1315 lyxerr << "wrong pit " << copy.pit()
1316 << ", max is " << copy.lastpit()
1317 << " at level " << copy.depth()
1318 << ". Trying to correct this." << endl;
1319 newdepth = copy.depth() - 1;
1321 else if (copy.pos() > copy.lastpos()) {
1322 lyxerr << "wrong pos " << copy.pos()
1323 << ", max is " << copy.lastpos()
1324 << " at level " << copy.depth()
1325 << ". Trying to correct this." << endl;
1326 newdepth = copy.depth() - 1;
1330 // shrink cursor to a size where everything is valid, possibly
1332 while (depth() > newdepth) {
1334 lyxerr << "correcting cursor to level " << depth() << endl;