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"
18 #include "coordcache.h"
19 #include "CutAndPaste.h"
21 #include "dispatchresult.h"
23 #include "funcrequest.h"
27 #include "lyxfunc.h" // only for setMessage()
31 #include "paragraph.h"
32 #include "paragraph_funcs.h"
33 #include "pariterator.h"
35 #include "insets/insettabular.h"
36 #include "insets/insettext.h"
38 #include "mathed/MathData.h"
39 #include "mathed/InsetMath.h"
40 #include "mathed/InsetMathScript.h"
41 #include "mathed/MathMacroTable.h"
43 #include "support/limited_stack.h"
45 #include <boost/assert.hpp>
46 #include <boost/bind.hpp>
47 #include <boost/current_function.hpp>
58 #ifndef CXX_GLOBAL_CSTD
67 positionable(DocIterator const & cursor, DocIterator const & anchor)
69 // avoid deeper nested insets when selecting
70 if (cursor.depth() > anchor.depth())
73 // anchor might be deeper, should have same path then
74 for (size_t i = 0; i < cursor.depth(); ++i)
75 if (&cursor[i].inset() != &anchor[i].inset())
78 // position should be ok.
83 // Find position closest to (x, y) in cell given by iter.
84 // Used only in mathed
85 DocIterator bruteFind2(LCursor const & c, int x, int y)
87 double best_dist = std::numeric_limits<double>::max();
94 et.top().pos() = et.top().asInsetMath()->cell(et.top().idx()).size();
95 for (size_t i = 0; ; ++i) {
98 InsetBase const * inset = &it.inset();
99 std::map<InsetBase const *, Point> const & data =
100 c.bv().coordCache().getInsets().getData();
101 std::map<InsetBase const *, Point>::const_iterator I = data.find(inset);
103 // FIXME: in the case where the inset is not in the cache, this
104 // means that no part of it is visible on screen. In this case
105 // we don't do elaborate search and we just return the forwarded
106 // DocIterator at its beginning.
107 if (I == data.end()) {
113 inset->cursorPos(c.bv(), it.top(), c.boundary(), xo, yo);
114 // Convert to absolute
117 double d = (x - xo) * (x - xo) + (y - yo) * (y - yo);
118 // '<=' in order to take the last possible position
119 // this is important for clicking behind \sum in e.g. '\sum_i a'
120 lyxerr[Debug::DEBUG] << "i: " << i << " d: " << d
121 << " best: " << best_dist << endl;
122 if (d <= best_dist) {
134 /// moves position closest to (x, y) in given box
135 bool bruteFind(LCursor & cursor,
136 int x, int y, int xlow, int xhigh, int ylow, int yhigh)
138 BOOST_ASSERT(!cursor.empty());
139 InsetBase & inset = cursor[0].inset();
140 BufferView & bv = cursor.bv();
142 CoordCache::InnerParPosCache const & cache =
143 bv.coordCache().getParPos().find(cursor.bottom().text())->second;
144 // Get an iterator on the first paragraph in the cache
145 DocIterator it(inset);
146 it.push_back(CursorSlice(inset));
147 it.pit() = cache.begin()->first;
148 // Get an iterator after the last paragraph in the cache
149 DocIterator et(inset);
150 et.push_back(CursorSlice(inset));
151 et.pit() = boost::prior(cache.end())->first;
152 if (et.pit() >= et.lastpit())
153 et = doc_iterator_end(inset);
157 double best_dist = std::numeric_limits<double>::max();;
158 DocIterator best_cursor = et;
160 for ( ; it != et; it.forwardPos(true)) {
161 // avoid invalid nesting when selecting
162 if (!cursor.selection() || positionable(it, cursor.anchor_)) {
163 Point p = bv_funcs::getPos(bv, it, false);
166 if (xlow <= xo && xo <= xhigh && ylow <= yo && yo <= yhigh) {
167 double const dx = xo - x;
168 double const dy = yo - y;
169 double const d = dx * dx + dy * dy;
170 // '<=' in order to take the last possible position
171 // this is important for clicking behind \sum in e.g. '\sum_i a'
172 if (d <= best_dist) {
173 // lyxerr << "*" << endl;
181 if (best_cursor != et) {
182 cursor.setCursor(best_cursor);
190 /// moves position closest to (x, y) in given box
191 bool bruteFind3(LCursor & cur, int x, int y, bool up)
193 BufferView & bv = cur.bv();
194 int ylow = up ? 0 : y + 1;
195 int yhigh = up ? y - 1 : bv.workHeight();
197 int xhigh = bv.workWidth();
199 // FIXME: bit more work needed to get 'from' and 'to' right.
200 pit_type from = cur.bottom().pit();
201 //pit_type to = cur.bottom().pit();
202 //lyxerr << "Pit start: " << from << endl;
204 //lyxerr << "bruteFind3: x: " << x << " y: " << y
205 // << " xlow: " << xlow << " xhigh: " << xhigh
206 // << " ylow: " << ylow << " yhigh: " << yhigh
208 InsetBase & inset = bv.buffer()->inset();
209 DocIterator it = doc_iterator_begin(inset);
211 DocIterator et = doc_iterator_end(inset);
213 double best_dist = std::numeric_limits<double>::max();
214 DocIterator best_cursor = et;
216 for ( ; it != et; it.forwardPos()) {
217 // avoid invalid nesting when selecting
218 if (bv_funcs::status(&bv, it) == bv_funcs::CUR_INSIDE
219 && (!cur.selection() || positionable(it, cur.anchor_))) {
220 Point p = bv_funcs::getPos(bv, it, false);
223 if (xlow <= xo && xo <= xhigh && ylow <= yo && yo <= yhigh) {
224 double const dx = xo - x;
225 double const dy = yo - y;
226 double const d = dx * dx + dy * dy;
227 //lyxerr << "itx: " << xo << " ity: " << yo << " d: " << d
228 // << " dx: " << dx << " dy: " << dy
229 // << " idx: " << it.idx() << " pos: " << it.pos()
232 // '<=' in order to take the last possible position
233 // this is important for clicking behind \sum in e.g. '\sum_i a'
234 if (d <= best_dist) {
235 //lyxerr << "*" << endl;
243 //lyxerr << "best_dist: " << best_dist << " cur:\n" << best_cursor << endl;
244 if (best_cursor == et)
246 cur.setCursor(best_cursor);
253 // be careful: this is called from the bv's constructor, too, so
254 // bv functions are not yet available!
255 LCursor::LCursor(BufferView & bv)
256 : DocIterator(), bv_(&bv), anchor_(), x_target_(-1),
257 selection_(false), mark_(false), logicalpos_(false)
261 void LCursor::reset(InsetBase & inset)
264 push_back(CursorSlice(inset));
265 anchor_ = DocIterator(inset);
272 // this (intentionally) does neither touch anchor nor selection status
273 void LCursor::setCursor(DocIterator const & cur)
275 DocIterator::operator=(cur);
279 void LCursor::dispatch(FuncRequest const & cmd0)
281 lyxerr[Debug::DEBUG] << BOOST_CURRENT_FUNCTION
282 << " cmd: " << cmd0 << '\n'
288 FuncRequest cmd = cmd0;
289 LCursor safe = *this;
291 for (; depth(); pop()) {
292 lyxerr[Debug::DEBUG] << "LCursor::dispatch: cmd: "
293 << cmd0 << endl << *this << endl;
294 BOOST_ASSERT(pos() <= lastpos());
295 BOOST_ASSERT(idx() <= lastidx());
296 BOOST_ASSERT(pit() <= lastpit());
298 // The common case is 'LFUN handled, need update', so make the
299 // LFUN handler's life easier by assuming this as default value.
300 // The handler can reset the update and val flags if necessary.
301 disp_.update(Update::FitCursor | Update::Force);
302 disp_.dispatched(true);
303 inset().dispatch(*this, cmd);
304 if (disp_.dispatched())
307 // it completely to get a 'bomb early' behaviour in case this
308 // object will be used again.
309 if (!disp_.dispatched()) {
310 lyxerr[Debug::DEBUG] << "RESTORING OLD CURSOR!" << endl;
312 disp_.update(Update::None);
313 disp_.dispatched(false);
318 DispatchResult LCursor::result() const
324 BufferView & LCursor::bv() const
331 Buffer & LCursor::buffer() const
334 BOOST_ASSERT(bv_->buffer());
335 return *bv_->buffer();
341 BOOST_ASSERT(depth() >= 1);
346 void LCursor::push(InsetBase & p)
348 push_back(CursorSlice(p));
352 void LCursor::pushLeft(InsetBase & p)
354 BOOST_ASSERT(!empty());
355 //lyxerr << "Entering inset " << t << " left" << endl;
361 bool LCursor::popLeft()
363 BOOST_ASSERT(!empty());
364 //lyxerr << "Leaving inset to the left" << endl;
365 inset().notifyCursorLeaves(*this);
373 bool LCursor::popRight()
375 BOOST_ASSERT(!empty());
376 //lyxerr << "Leaving inset to the right" << endl;
377 const pos_type lp = (depth() > 1) ? (*this)[depth() - 2].lastpos() : 0;
378 inset().notifyCursorLeaves(*this);
382 pos() += lastpos() - lp + 1;
387 int LCursor::currentMode()
389 BOOST_ASSERT(!empty());
390 for (int i = depth() - 1; i >= 0; --i) {
391 int res = operator[](i).inset().currentMode();
392 if (res != InsetBase::UNDECIDED_MODE)
395 return InsetBase::TEXT_MODE;
399 void LCursor::getPos(int & x, int & y) const
401 Point p = bv_funcs::getPos(bv(), *this, boundary());
407 Row & LCursor::textRow()
409 BOOST_ASSERT(!paragraph().rows().empty());
410 return paragraph().getRow(pos(), boundary());
414 Row const & LCursor::textRow() const
416 BOOST_ASSERT(!paragraph().rows().empty());
417 return paragraph().getRow(pos(), boundary());
421 void LCursor::resetAnchor()
428 bool LCursor::posLeft()
437 bool LCursor::posRight()
439 if (pos() == lastpos())
446 CursorSlice LCursor::anchor() const
448 BOOST_ASSERT(anchor_.depth() >= depth());
449 CursorSlice normal = anchor_[depth() - 1];
450 if (depth() < anchor_.depth() && top() <= normal) {
451 // anchor is behind cursor -> move anchor behind the inset
458 CursorSlice LCursor::selBegin() const
462 return anchor() < top() ? anchor() : top();
466 CursorSlice LCursor::selEnd() const
470 return anchor() > top() ? anchor() : top();
474 DocIterator LCursor::selectionBegin() const
478 DocIterator di = (anchor() < top() ? anchor_ : *this);
484 DocIterator LCursor::selectionEnd() const
488 DocIterator di = (anchor() > top() ? anchor_ : *this);
489 if (di.depth() > depth()) {
497 void LCursor::setSelection()
500 // A selection with no contents is not a selection
502 #warning doesnt look ok
504 if (pit() == anchor().pit() && pos() == anchor().pos())
509 void LCursor::setSelection(DocIterator const & where, int n)
518 void LCursor::clearSelection()
526 int & LCursor::x_target()
532 int LCursor::x_target() const
538 void LCursor::clearTargetX()
545 void LCursor::info(odocstream & os) const
547 for (int i = 1, n = depth(); i < n; ++i) {
548 operator[](i).inset().infoize(os);
552 prevInset()->infoize2(os);
553 // overwite old message
558 bool LCursor::selHandle(bool sel)
560 //lyxerr << "LCursor::selHandle" << endl;
561 if (sel == selection())
570 std::ostream & operator<<(std::ostream & os, LCursor const & cur)
572 os << "\n cursor: | anchor:\n";
573 for (size_t i = 0, n = cur.depth(); i != n; ++i) {
574 os << " " << cur[i] << " | ";
575 if (i < cur.anchor_.depth())
576 os << cur.anchor_[i];
578 os << "-------------------------------";
581 for (size_t i = cur.depth(), n = cur.anchor_.depth(); i < n; ++i) {
582 os << "------------------------------- | " << cur.anchor_[i] << "\n";
584 os << " selection: " << cur.selection_
585 << " x_target: " << cur.x_target_ << endl;
592 ///////////////////////////////////////////////////////////////////
594 // The part below is the non-integrated rest of the original math
595 // cursor. This should be either generalized for texted or moved
596 // back to mathed (in most cases to InsetMathNest).
598 ///////////////////////////////////////////////////////////////////
600 #include "mathed/InsetMathChar.h"
601 #include "mathed/InsetMathGrid.h"
602 #include "mathed/InsetMathScript.h"
603 #include "mathed/InsetMathUnknown.h"
604 #include "mathed/MathFactory.h"
605 #include "mathed/MathMacroArgument.h"
606 #include "mathed/MathStream.h"
607 #include "mathed/MathSupport.h"
612 //#define FILEDEBUG 1
615 bool LCursor::isInside(InsetBase const * p)
617 for (size_t i = 0; i != depth(); ++i)
618 if (&operator[](i).inset() == p)
624 void LCursor::leaveInset(InsetBase const & inset)
626 for (size_t i = 0; i != depth(); ++i) {
627 if (&operator[](i).inset() == &inset) {
635 bool LCursor::openable(MathAtom const & t) const
646 // we can't move into anything new during selection
647 if (depth() >= anchor_.depth())
649 if (!ptr_cmp(t.nucleus(), &anchor_[depth()].inset()))
656 void LCursor::setScreenPos(int x, int y)
659 bruteFind(*this, x, y, 0, bv().workWidth(), 0, bv().workHeight());
664 void LCursor::plainErase()
670 void LCursor::markInsert()
672 insert(char_type(0));
676 void LCursor::markErase()
682 void LCursor::plainInsert(MathAtom const & t)
684 cell().insert(pos(), t);
689 void LCursor::insert(docstring const & str)
691 for_each(str.begin(), str.end(),
692 boost::bind(static_cast<void(LCursor::*)(char_type)>
693 (&LCursor::insert), this, _1));
697 void LCursor::insert(char_type c)
699 //lyxerr << "LCursor::insert char '" << c << "'" << endl;
700 BOOST_ASSERT(!empty());
702 cap::selClearOrDel(*this);
703 insert(new InsetMathChar(c));
705 text()->insertChar(*this, c);
710 void LCursor::insert(MathAtom const & t)
712 //lyxerr << "LCursor::insert MathAtom '" << t << "'" << endl;
714 cap::selClearOrDel(*this);
719 void LCursor::insert(InsetBase * inset)
722 insert(MathAtom(inset));
724 text()->insertInset(*this, inset);
728 void LCursor::niceInsert(docstring const & t)
739 void LCursor::niceInsert(MathAtom const & t)
742 docstring const safe = cap::grabAndEraseSelection(*this);
744 // enter the new inset and move the contents of the selection if possible
747 // be careful here: don't use 'pushLeft(t)' as this we need to
748 // push the clone, not the original
749 pushLeft(*nextInset());
750 // We may not use niceInsert here (recursion)
758 void LCursor::insert(MathArray const & ar)
762 cap::eraseSelection(*this);
763 cell().insert(pos(), ar);
768 bool LCursor::backspace()
770 autocorrect() = false;
778 // If empty cell, and not part of a big cell
779 if (lastpos() == 0 && inset().nargs() == 1) {
781 // Directly delete empty cell: [|[]] => [|]
787 // [|], can not delete from inside
797 InsetMathUnknown * p = activeMacro();
798 if (p->name().size() > 1) {
799 p->setName(p->name().substr(0, p->name().size() - 1));
804 if (pos() != 0 && prevAtom()->nargs() > 0) {
805 // let's require two backspaces for 'big stuff' and
806 // highlight on the first
818 bool LCursor::erase()
820 autocorrect() = false;
829 // delete empty cells if possible
830 if (pos() == lastpos() && inset().idxDelete(idx()))
833 // special behaviour when in last position of cell
834 if (pos() == lastpos()) {
835 bool one_cell = inset().nargs() == 1;
836 if (one_cell && lastpos() == 0) {
838 // Directly delete empty cell: [|[]] => [|]
844 // [|], can not delete from inside
849 inset().idxGlue(idx());
853 // 'clever' UI hack: only erase large items if previously slected
854 if (pos() != lastpos() && nextAtom()->nargs() > 0) {
869 DocIterator save = *this;
873 autocorrect() = false;
881 DocIterator save = *this;
885 autocorrect() = false;
890 bool LCursor::macroModeClose()
894 InsetMathUnknown * p = activeMacro();
896 docstring const s = p->name();
900 // do nothing if the macro name is empty
904 // prevent entering of recursive macros
905 // FIXME: this is only a weak attempt... only prevents immediate
907 docstring const name = s.substr(1);
908 InsetBase const * macro = innerInsetOfType(InsetBase::MATHMACRO_CODE);
909 if (macro && macro->getInsetName() == name)
910 lyxerr << "can't enter recursive macro" << endl;
912 InsetMathNest * const in = inset().asInsetMath()->asNestInset();
913 if (in && in->interpretString(*this, s))
915 plainInsert(createInsetMath(name));
920 docstring LCursor::macroName()
922 return inMacroMode() ? activeMacro()->name() : docstring();
926 void LCursor::handleNest(MathAtom const & a, int c)
928 //lyxerr << "LCursor::handleNest: " << c << endl;
930 asArray(cap::grabAndEraseSelection(*this), t.nucleus()->cell(c));
933 pushLeft(*nextInset());
937 int LCursor::targetX() const
939 if (x_target() != -1)
948 void LCursor::setTargetX()
957 bool LCursor::inMacroMode() const
961 InsetMathUnknown const * p = prevAtom()->asUnknownInset();
962 return p && !p->final();
966 InsetMathUnknown * LCursor::activeMacro()
968 return inMacroMode() ? prevAtom().nucleus()->asUnknownInset() : 0;
972 void LCursor::pullArg()
977 MathArray ar = cell();
978 if (popLeft() && inMathed()) {
980 cell().insert(pos(), ar);
983 //formula()->mutateToText();
988 void LCursor::touch()
994 DocIterator::const_iterator it = begin();
995 DocIterator::const_iterator et = end();
996 for ( ; it != et; ++it)
1002 void LCursor::normalize()
1004 if (idx() > lastidx()) {
1005 lyxerr << "this should not really happen - 1: "
1006 << idx() << ' ' << nargs()
1007 << " in: " << &inset() << endl;
1011 if (pos() > lastpos()) {
1012 lyxerr << "this should not really happen - 2: "
1013 << pos() << ' ' << lastpos() << " in idx: " << idx()
1015 odocstringstream os;
1016 WriteStream wi(os, false, true);
1017 inset().asInsetMath()->write(wi);
1018 lyxerr << to_utf8(os.str()) << endl;
1024 bool LCursor::goUpDown(bool up)
1026 // Be warned: The 'logic' implemented in this function is highly
1027 // fragile. A distance of one pixel or a '<' vs '<=' _really
1028 // matters. So fiddle around with it only if you think you know
1029 // what you are doing!
1035 // check if we had something else in mind, if not, this is the future
1037 if (x_target() == -1)
1042 // try neigbouring script insets
1046 InsetMathScript const * p = prevAtom()->asScriptInset();
1047 if (p && p->has(up)) {
1049 push(*const_cast<InsetMathScript*>(p));
1050 idx() = p->idxOfScript(up);
1057 if (pos() != lastpos()) {
1058 InsetMathScript const * p = nextAtom()->asScriptInset();
1059 if (p && p->has(up)) {
1060 push(*const_cast<InsetMathScript*>(p));
1061 idx() = p->idxOfScript(up);
1068 // FIXME: Switch this on for more robust movement
1071 return bruteFind3(*this, xo, yo, up);
1074 //xarray().boundingBox(xlow, xhigh, ylow, yhigh);
1079 //if (bruteFind(*this, xo, yo, xlow, xhigh, ylow, yhigh)) {
1080 // lyxerr << "updown: handled by brute find in the same cell" << endl;
1084 // try to find an inset that knows better then we
1086 //lyxerr << "updown: We are in " << &inset() << " idx: " << idx() << endl;
1088 if (inset().idxUpDown(*this, up)) {
1089 //lyxerr << "idxUpDown triggered" << endl;
1090 // try to find best position within this inset
1092 setCursor(bruteFind2(*this, xo, yo));
1096 // no such inset found, just take something "above"
1098 //lyxerr << "updown: popleft failed (strange case)" << endl;
1099 int ylow = up ? 0 : yo + 1;
1100 int yhigh = up ? yo - 1 : bv().workHeight();
1101 return bruteFind(*this, xo, yo, 0, bv().workWidth(), ylow, yhigh);
1104 // any improvement so far?
1105 //lyxerr << "updown: popLeft succeeded" << endl;
1109 if (up ? ynew < yo : ynew > yo)
1113 // we should not come here.
1114 BOOST_ASSERT(false);
1119 void LCursor::handleFont(string const & font)
1121 lyxerr[Debug::DEBUG] << BOOST_CURRENT_FUNCTION << ": " << font << endl;
1125 safe = cap::grabAndEraseSelection(*this);
1128 if (lastpos() != 0) {
1129 // something left in the cell
1131 // cursor in first position
1133 } else if (pos() == lastpos()) {
1134 // cursor in last position
1137 // cursor in between. split cell
1138 MathArray::iterator bt = cell().begin();
1139 MathAtom at = createInsetMath(from_utf8(font));
1140 at.nucleus()->cell(0) = MathArray(bt, bt + pos());
1141 cell().erase(bt, bt + pos());
1146 // nothing left in the cell
1154 void LCursor::message(docstring const & msg) const
1156 theLyXFunc().setMessage(msg);
1160 void LCursor::errorMessage(docstring const & msg) const
1162 theLyXFunc().setErrorMessage(msg);
1166 docstring LCursor::selectionAsString(bool label) const
1172 Buffer const & buffer = *bv().buffer();
1173 ParagraphList const & pars = text()->paragraphs();
1175 // should be const ...
1176 pit_type startpit = selBegin().pit();
1177 pit_type endpit = selEnd().pit();
1178 size_t const startpos = selBegin().pos();
1179 size_t const endpos = selEnd().pos();
1181 if (startpit == endpit)
1182 return pars[startpit].asString(buffer, startpos, endpos, label);
1184 // First paragraph in selection
1185 docstring result = pars[startpit].
1186 asString(buffer, startpos, pars[startpit].size(), label) + "\n\n";
1188 // The paragraphs in between (if any)
1189 for (pit_type pit = startpit + 1; pit != endpit; ++pit) {
1190 Paragraph const & par = pars[pit];
1191 result += par.asString(buffer, 0, par.size(), label) + "\n\n";
1194 // Last paragraph in selection
1195 result += pars[endpit].asString(buffer, 0, endpos, label);
1201 return cap::grabSelection(*this);
1207 docstring LCursor::currentState()
1210 odocstringstream os;
1216 return text()->currentState(*this);
1222 docstring LCursor::getPossibleLabel()
1224 return inMathed() ? from_ascii("eq:") : text()->getPossibleLabel(*this);
1228 Encoding const * LCursor::getEncoding() const
1235 // go up until first non-0 text is hit
1236 // (innermost text is 0 in mathed)
1237 for (s = depth() - 1; s >= 0; --s)
1238 if (operator[](s).text())
1240 CursorSlice const & sl = operator[](s);
1241 LyXText const & text = *sl.text();
1242 LyXFont font = text.getPar(sl.pit()).getFont(
1243 bv().buffer()->params(), sl.pos(), outerFont(sl.pit(), text.paragraphs()));
1244 return font.language()->encoding();
1248 void LCursor::undispatched()
1250 disp_.dispatched(false);
1254 void LCursor::dispatched()
1256 disp_.dispatched(true);
1260 void LCursor::updateFlags(Update::flags f)
1266 void LCursor::noUpdate()
1268 disp_.update(Update::None);
1272 LyXFont LCursor::getFont() const
1274 // HACK. far from being perfect...
1276 // go up until first non-0 text is hit
1277 // (innermost text is 0 in mathed)
1278 for (s = depth() - 1; s >= 0; --s)
1279 if (operator[](s).text())
1281 CursorSlice const & sl = operator[](s);
1282 LyXText const & text = *sl.text();
1283 LyXFont font = text.getPar(sl.pit()).getFont(
1284 bv().buffer()->params(),
1286 outerFont(sl.pit(), text.paragraphs()));
1292 void LCursor::fixIfBroken()
1294 // find out last good level
1295 LCursor copy = *this;
1296 size_t newdepth = depth();
1297 while (!copy.empty()) {
1298 if (copy.idx() > copy.lastidx()) {
1299 lyxerr << "wrong idx " << copy.idx()
1300 << ", max is " << copy.lastidx()
1301 << " at level " << copy.depth()
1302 << ". Trying to correct this." << endl;
1303 newdepth = copy.depth() - 1;
1305 else if (copy.pit() > copy.lastpit()) {
1306 lyxerr << "wrong pit " << copy.pit()
1307 << ", max is " << copy.lastpit()
1308 << " at level " << copy.depth()
1309 << ". Trying to correct this." << endl;
1310 newdepth = copy.depth() - 1;
1312 else if (copy.pos() > copy.lastpos()) {
1313 lyxerr << "wrong pos " << copy.pos()
1314 << ", max is " << copy.lastpos()
1315 << " at level " << copy.depth()
1316 << ". Trying to correct this." << endl;
1317 newdepth = copy.depth() - 1;
1321 // shrink cursor to a size where everything is valid, possibly
1323 while (depth() > newdepth) {
1325 lyxerr << "correcting cursor to level " << depth() << endl;