void CoordCache::clear()
{
- lyxerr << "CoordCache: removing " << arrays_.data_.size()
- << " arrays" << std::endl;
- lyxerr << "CoordCache: removing " << insets_.data_.size()
- << " insets" << std::endl;
+// lyxerr << "CoordCache: removing " << arrays_.data_.size()
+// << " arrays" << std::endl;
+// lyxerr << "CoordCache: removing " << insets_.data_.size()
+// << " insets" << std::endl;
arrays_.clear();
insets_.clear();
}
BOOST_ASSERT(!empty());
if (pos() == lastpos())
return 0;
+ if (pos() > lastpos()) {
+ lyxerr << "Should not happen, but it does. " << endl;
+ return 0;
+ }
if (inMathed())
return nextAtom().nucleus();
return paragraph().isInset(pos()) ? paragraph().getInset(pos()) : 0;
}
-DocIterator
-StableDocIterator::asDocIterator(InsetBase * inset) const
+DocIterator StableDocIterator::asDocIterator(InsetBase * inset) const
{
// this function re-creates the cache of inset pointers
//lyxerr << "converting:\n" << *this << endl;
DocIterator dit = DocIterator(*inset);
for (size_t i = 0, n = data_.size(); i != n; ++i) {
+ if (inset == 0) {
+ // FIXME
+ lyxerr << "Should not happen, but does e.g. after C-n C-l C-z S-C-z"
+ << endl << "dit: " << dit << endl
+ << " lastpos: " << dit.lastpos() << endl;
+ break;
+ }
dit.push_back(data_[i]);
dit.back().inset_ = inset;
if (i + 1 != n)
int LyXText::rightMargin(Paragraph const & par) const
{
- LyXTextClass const & tclass = bv()->buffer()->params().getLyXTextClass();
-
// We do not want rightmargins on inner texts.
if (bv()->text() != this)
return 0;
+ LyXTextClass const & tclass = bv()->buffer()->params().getLyXTextClass();
int const r_margin =
::rightMargin()
+ font_metrics::signedWidth(tclass.rightmargin(),
* 4 / (par.getDepth() + 4);
return r_margin;
-
}
#include <algorithm>
-using std::advance;
-
using lyx::par_type;
+using std::advance;
using std::endl;
std::ostream & operator<<(std::ostream & os, Undo const & undo)
{
- return os << " from: " << undo.from
- << " end: " << undo.end
+ return os << " from: " << undo.from << " end: " << undo.end
<< " cursor:\n" << undo.cursor;
}
Undo undo;
undo.kind = kind;
undo.cursor = StableDocIterator(cur);
+ lyxerr << "recordUndo: cur: " << cur << endl;
+ lyxerr << "recordUndo: undo.cursor: " << undo.cursor << endl;
undo.from = first_par;
undo.end = cur.lastpar() - last_par;
}
-// returns false if no undo possible
+// Returns false if no undo possible.
bool textUndoOrRedo(BufferView & bv,
limited_stack<Undo> & stack, limited_stack<Undo> & otherstack)
{
if (stack.empty()) {
- // nothing to do
+ // Nothing to do.
finishUndo();
return false;
}
stack.pop();
finishUndo();
- // this implements redo
+ // This implements redo
otherstack.push(undo);
- DocIterator dit =
- undo.cursor.asDocIterator(&bv.buffer()->inset());
+ // FIXME: This triggers the error in dociterator.C +454
+ // could the reason be that we rebuild the dit _before_ the
+ // contents is actually 'undone'?
+ // I.e. state now is 'A', state on undo stack is 'B'.
+ // dit is created according to positions from undo.cursor, i.e. B
+ // but current buffer contents is more likely 'A'.
+ DocIterator dit = undo.cursor.asDocIterator(&bv.buffer()->inset());
if (dit.inMathed()) {
// Easy way out: store a full cell.
otherstack.top().array = asString(dit.cell());
void finishUndo()
{
- // makes sure the next operation will be stored
+ // Make sure the next operation will be stored.
undo_finished = true;
}