lyx_mirror/src/undo.C

328 lines
7.6 KiB
C++
Raw Normal View History

/**
* \file undo.C
* This file is part of LyX, the document processor.
* Licence details can be found in the file COPYING.
*
* \author Asger Alstrup
* \author Lars Gullik Bj<EFBFBD>nnes
* \author John Levon
* \author Andr<EFBFBD> P<EFBFBD>nitz
* \author J<EFBFBD>rgen Vigna
*
* Full author contact details are available in file CREDITS.
*/
#include <config.h>
#include "undo.h"
#include "buffer.h"
#include "cursor.h"
#include "debug.h"
#include "BufferView.h"
#include "iterators.h"
#include "lyxtext.h"
#include "paragraph.h"
using lyx::paroffset_type;
namespace {
/// Whether actions are not added to the undo stacks.
bool undo_frozen;
/// The flag used by finishUndo().
bool undo_finished;
std::ostream & operator<<(std::ostream & os, Undo const & undo)
{
return os << " text: " << undo.text
<< " index: " << undo.index
<< " first: " << undo.first_par
<< " from end: " << undo.end_par
<< " cursor: " << undo.cursor_par
<< "/" << undo.cursor_pos;
}
// translates LyXText pointer into offset count from document begin
ParIterator text2pit(Buffer & buf, LyXText * text, int & tcount)
{
tcount = 0;
ParIterator pit = buf.par_iterator_begin();
ParIterator end = buf.par_iterator_end();
for ( ; pit != end; ++pit, ++tcount)
if (pit.text(buf) == text)
return pit;
lyxerr << "undo: should not happen" << std::endl;
return end;
}
// translates offset from buffer begin to ParIterator
ParIterator num2pit(Buffer & buf, int num)
{
ParIterator pit = buf.par_iterator_begin();
ParIterator end = buf.par_iterator_end();
for ( ; num && pit != end; ++pit, --num)
;
if (pit != end)
return pit;
// don't crash early...
lyxerr << "undo: num2pit: num: " << num << std::endl;
BOOST_ASSERT(false);
return buf.par_iterator_begin();
}
void recordUndo(Undo::undo_kind kind,
LCursor & cur, paroffset_type first_par, paroffset_type last_par,
limited_stack<Undo> & stack)
{
#if 0
DocumentIterator it = bufferBegin(cur.bv());
DocumentIterator et = bufferEnd();
size_t count = 0;
for ( ; it != et; it.forwardPos(), ++count)
if (it.top() == cur.top())
lyxerr << "### found at " << count << std::endl;
#endif
if (first_par > last_par) {
paroffset_type t = first_par;
first_par = last_par;
last_par = t;
}
Buffer & buf = *cur.bv().buffer();
int const end_par = cur.lastpar() + 1 - last_par;
// Undo::ATOMIC are always recorded (no overlapping there).
// overlapping only with insert and delete inside one paragraph:
// nobody wants all removed character appear one by one when undoing.
if (!undo_finished && kind != Undo::ATOMIC) {
// Check whether storing is needed.
if (!buf.undostack().empty()
&& buf.undostack().top().kind == kind
&& buf.undostack().top().first_par == first_par
&& buf.undostack().top().end_par == end_par) {
// No additonal undo recording needed -
// effectively, we combine undo recordings to one.
return;
}
}
// push and fill the Undo entry
if (cur.inTexted()) {
stack.push(Undo());
LyXText * text = cur.text();
int textnum;
ParIterator pit = text2pit(buf, text, textnum);
Undo & undo = stack.top();
undo.kind = kind;
undo.text = textnum;
undo.index = pit.index();
undo.first_par = first_par;
undo.end_par = end_par;
undo.cursor_par = cur.par();
undo.cursor_pos = cur.pos();
undo.math = false;
//lyxerr << "undo record: " << stack.top() << std::endl;
// record the relevant paragraphs
ParagraphList & plist = text->paragraphs();
ParagraphList::iterator first = plist.begin();
advance(first, first_par);
ParagraphList::iterator last = plist.begin();
advance(last, last_par);
for (ParagraphList::iterator it = first; it != last; ++it)
undo.pars.push_back(*it);
undo.pars.push_back(*last);
} else {
BOOST_ASSERT(false); // not in mathed (yet)
stack.push(Undo());
Undo & undo = stack.top();
undo.math = false;
}
// and make sure that next time, we should be combining if possible
undo_finished = false;
}
// returns false if no undo possible
bool performUndoOrRedo(BufferView & bv, Undo const & undo)
{
Buffer & buf = *bv.buffer();
lyxerr << "undo, performing: " << undo << std::endl;
ParIterator pit = num2pit(buf, undo.text);
LyXText * text = pit.text(buf);
ParagraphList & plist = text->paragraphs();
// remove new stuff between first and last
{
ParagraphList::iterator first = plist.begin();
advance(first, undo.first_par);
ParagraphList::iterator last = plist.begin();
advance(last, plist.size() - undo.end_par);
plist.erase(first, ++last);
}
// re-insert old stuff instead
if (plist.empty()) {
plist.assign(undo.pars.begin(), undo.pars.end());
} else {
ParagraphList::iterator first = plist.begin();
advance(first, undo.first_par);
plist.insert(first, undo.pars.begin(), undo.pars.end());
}
// set cursor
lyxerr << "undo, text: " << undo.text
<< " inset: " << pit.inset()
<< " index: " << undo.index
<< " par: " << undo.cursor_par
<< " pos: " << undo.cursor_pos
<< std::endl;
text->updateCounters();
// rebreak the entire lyxtext
#warning needed?
text->redoParagraphs(buf.paragraphs().begin(), buf.paragraphs().end());
bv.cursor().resetAnchor();
ParIterator pit2 = num2pit(buf, undo.text);
advance(pit2, undo.cursor_par);
bv.setCursor(pit2, undo.cursor_pos);
finishUndo();
return true;
}
// returns false if no undo possible
bool textUndoOrRedo(BufferView & bv,
limited_stack<Undo> & stack, limited_stack<Undo> & otherstack)
{
Buffer & buf = *bv.buffer();
if (stack.empty()) {
// nothing to do
finishUndo();
return false;
}
Undo undo = stack.top();
stack.pop();
finishUndo();
if (!undo_frozen) {
otherstack.push(undo);
otherstack.top().pars.clear();
ParIterator pit = num2pit(buf, undo.text);
ParagraphList & plist = pit.plist();
if (undo.first_par + undo.end_par <= int(plist.size())) {
ParagraphList::iterator first = plist.begin();
advance(first, undo.first_par);
ParagraphList::iterator last = plist.begin();
advance(last, plist.size() - undo.end_par + 1);
otherstack.top().pars.insert(otherstack.top().pars.begin(), first, last);
}
otherstack.top().cursor_pos = bv.cursor().pos();
otherstack.top().cursor_par = bv.cursor().par();
lyxerr << " undo other: " << otherstack.top() << std::endl;
}
freezeUndo();
bool const ret = performUndoOrRedo(bv, undo);
unFreezeUndo();
return ret;
}
} // namespace anon
void freezeUndo()
{
// this is dangerous and for internal use only
undo_frozen = true;
}
void unFreezeUndo()
{
// this is dangerous and for internal use only
undo_frozen = false;
}
void finishUndo()
{
// makes sure the next operation will be stored
undo_finished = true;
}
bool textUndo(BufferView & bv)
{
return textUndoOrRedo(bv, bv.buffer()->undostack(),
bv.buffer()->redostack());
}
bool textRedo(BufferView & bv)
{
return textUndoOrRedo(bv, bv.buffer()->redostack(),
bv.buffer()->undostack());
}
void recordUndo(Undo::undo_kind kind,
LCursor & cur, paroffset_type first, paroffset_type last)
{
if (undo_frozen)
return;
Buffer * buf = cur.bv().buffer();
recordUndo(kind, cur, first, last, buf->undostack());
buf->redostack().clear();
}
void recordUndo(LCursor & cur, Undo::undo_kind kind)
{
recordUndo(kind, cur, cur.par(), cur.par());
}
void recordUndoSelection(LCursor & cur, Undo::undo_kind kind)
{
recordUndo(kind, cur, cur.selBegin().par(), cur.selEnd().par());
}
void recordUndo(LCursor & cur, Undo::undo_kind kind, paroffset_type from)
{
recordUndo(kind, cur, cur.par(), from);
}
void recordUndo(LCursor & cur, Undo::undo_kind kind,
paroffset_type from, paroffset_type to)
{
recordUndo(kind, cur, from, to);
}
void recordUndoFullDocument(LCursor &)
{
//recordUndo(Undo::ATOMIC,
// cur, 0, cur.bv().text()->paragraphs().size() - 1);
}