-/* This file is part of
- * ======================================================
- *
- * LyX, The Document Processor
- *
- * Copyright 1995 Matthias Ettrich
- * Copyright 1995-1999 The LyX Team.
+/**
+ * \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ønnes
+ * \author John Levon
+ * \author André Pönitz
+ * \author Jürgen Vigna
+ *
+ * Full author contact details are available in file CREDITS.
+ */
#include <config.h>
#include "undo.h"
-#ifdef __GNUG__
-#pragma implementation
-#endif
+#include "buffer.h"
+#include "cursor.h"
+#include "debug.h"
+#include "BufferView.h"
+#include "lyxtext.h"
+#include "paragraph.h"
+
+#include "mathed/math_support.h"
+
+#include <algorithm>
+
+using std::advance;
+
+using lyx::par_type;
+
+using std::endl;
-Undo::Undo(undo_kind kind_arg,
- int number_before_arg, int number_behind_arg,
- int cursor_par_arg, int cursor_pos_arg,
- LyXParagraph * par_arg)
+namespace {
+
+/// The flag used by finishUndo().
+bool undo_finished;
+
+
+std::ostream & operator<<(std::ostream & os, Undo const & undo)
{
- kind = kind_arg;
- number_of_before_par = number_before_arg;
- number_of_behind_par = number_behind_arg;
- number_of_cursor_par = cursor_par_arg;
- cursor_pos = cursor_pos_arg;
- par = par_arg;
+ return os << " from: " << undo.from
+ << " end: " << undo.end
+ << " cursor:\n" << undo.cursor;
}
-Undo::~Undo()
+void recordUndo(Undo::undo_kind kind,
+ LCursor & cur, par_type first_par, par_type last_par,
+ limited_stack<Undo> & stack)
{
- LyXParagraph * tmppar;
- while (par) {
- tmppar = par;
- par = par->next;
- delete tmppar;
+ BOOST_ASSERT(first_par <= cur.lastpar());
+ BOOST_ASSERT(last_par <= cur.lastpar());
+
+ if (first_par > last_par)
+ std::swap(first_par, last_par);
+
+ // create the position information of the Undo entry
+ Undo undo;
+ undo.kind = kind;
+ undo.cursor = StableDocIterator(cur);
+ undo.from = first_par;
+ undo.end = cur.lastpar() - last_par;
+
+ // Undo::ATOMIC are always recorded (no overlapping there).
+ // As nobody wants all removed character appear one by one when undoing,
+ // we want combine 'similar' non-ATOMIC undo recordings to one.
+ if (!undo_finished
+ && kind != Undo::ATOMIC
+ && !stack.empty()
+ && stack.top().cursor.size() == undo.cursor.size()
+ && stack.top().kind == undo.kind
+ && stack.top().from == undo.from
+ && stack.top().end == undo.end)
+ return;
+
+ // fill in the real data to be saved
+ if (cur.inMathed()) {
+ // simply use the whole cell
+ undo.array = asString(cur.cell());
+ } else {
+ // some more effort needed here as 'the whole cell' of the
+ // main LyXText _is_ the whole document.
+ // record the relevant paragraphs
+ LyXText * text = cur.text();
+ BOOST_ASSERT(text);
+ ParagraphList & plist = text->paragraphs();
+ ParagraphList::iterator first = plist.begin();
+ advance(first, first_par);
+ ParagraphList::iterator last = plist.begin();
+ advance(last, last_par + 1);
+ undo.pars = ParagraphList(first, last);
}
+
+ // push the undo entry to undo stack
+ //lyxerr << "undo record: " << stack.top() << std::endl;
+ stack.push(undo);
+
+ // next time we'll try again to combine entries if possible
+ undo_finished = false;
}
-UndoStack::UndoStack()
- : limit(100) {}
+void performUndoOrRedo(BufferView & bv, Undo const & undo)
+{
+ LCursor & cur = bv.cursor();
+ lyxerr << "undo, performing: " << undo << std::endl;
+ cur.setCursor(undo.cursor.asDocIterator(&bv.buffer()->inset()));
+ cur.selection() = false;
+
+ if (cur.inMathed()) {
+ // We stored the full cell here as there is not much to be
+ // gained by storing just 'a few' paragraphs (most if not
+ // all math inset cells have just one paragraph!)
+ asArray(undo.array, cur.cell());
+ } else {
+ // Some finer machinery is needed here.
+ LyXText * text = cur.text();
+ BOOST_ASSERT(text);
+ ParagraphList & plist = text->paragraphs();
+
+ // remove new stuff between first and last
+ ParagraphList::iterator first = plist.begin();
+ advance(first, undo.from);
+ ParagraphList::iterator last = plist.begin();
+ advance(last, plist.size() - undo.end);
+ plist.erase(first, last);
+ // re-insert old stuff instead
+ first = plist.begin();
+ advance(first, undo.from);
+ plist.insert(first, undo.pars.begin(), undo.pars.end());
+ }
+
+ cur.resetAnchor();
+ finishUndo();
+}
-Undo * UndoStack::pop()
+
+// returns false if no undo possible
+bool textUndoOrRedo(BufferView & bv,
+ limited_stack<Undo> & stack, limited_stack<Undo> & otherstack)
{
- if (stakk.empty()) return 0;
- Undo * result = stakk.front();
- stakk.pop_front();
- return result;
+ if (stack.empty()) {
+ // nothing to do
+ finishUndo();
+ return false;
+ }
+
+ Undo undo = stack.top();
+ stack.pop();
+ finishUndo();
+
+ // this implements redo
+ otherstack.push(undo);
+ DocIterator dit =
+ undo.cursor.asDocIterator(&bv.buffer()->inset());
+ if (dit.inMathed()) {
+ // Easy way out: store a full cell.
+ otherstack.top().array = asString(dit.cell());
+ } else {
+ // As cells might be too large in texted, store just a part
+ // of the paragraph list.
+ otherstack.top().pars.clear();
+ LyXText * text = dit.text();
+ BOOST_ASSERT(text);
+ ParagraphList & plist = text->paragraphs();
+ if (undo.from + undo.end <= int(plist.size())) {
+ ParagraphList::iterator first = plist.begin();
+ advance(first, undo.from);
+ ParagraphList::iterator last = plist.begin();
+ advance(last, plist.size() - undo.end);
+ otherstack.top().pars.insert(otherstack.top().pars.begin(), first, last);
+ }
+ }
+ otherstack.top().cursor = bv.cursor();
+ //lyxerr << " undo other: " << otherstack.top() << std::endl;
+
+ performUndoOrRedo(bv, undo);
+ return true;
}
+} // namespace anon
-Undo * UndoStack::top()
+
+void finishUndo()
{
- if (stakk.empty()) return 0;
- return stakk.front();
+ // makes sure the next operation will be stored
+ undo_finished = true;
}
-UndoStack::~UndoStack()
+bool textUndo(BufferView & bv)
{
- clear();
+ return textUndoOrRedo(bv, bv.buffer()->undostack(),
+ bv.buffer()->redostack());
}
-void UndoStack::clear()
+bool textRedo(BufferView & bv)
{
- while (!stakk.empty()) {
- Undo * tmp = stakk.front();
- stakk.pop_front();
- delete tmp;
- }
+ return textUndoOrRedo(bv, bv.buffer()->redostack(),
+ bv.buffer()->undostack());
}
-void UndoStack::SetStackLimit(Stakk::size_type l)
+void recordUndo(Undo::undo_kind kind,
+ LCursor & cur, par_type first, par_type last)
{
- limit = l;
+ Buffer * buf = cur.bv().buffer();
+ recordUndo(kind, cur, first, last, buf->undostack());
+ buf->redostack().clear();
+ lyxerr << "undostack:\n";
+ for (size_t i = 0, n = buf->undostack().size(); i != n && i < 6; ++i)
+ lyxerr << " " << i << ": " << buf->undostack()[i] << std::endl;
}
-void UndoStack::push(Undo * undo_arg)
+void recordUndo(LCursor & cur, Undo::undo_kind kind)
{
- if (!undo_arg) return;
-
- stakk.push_front(undo_arg);
- if (stakk.size() > limit) {
- Undo * tmp = stakk.back();
- stakk.pop_back();
- delete tmp;
- }
+ recordUndo(kind, cur, cur.par(), cur.par());
}
-bool UndoStack::empty() const {
- return stakk.empty();
+void recordUndoInset(LCursor & cur, Undo::undo_kind kind)
+{
+ LCursor c = cur;
+ c.pop();
+ recordUndo(c, kind);
+}
+
+
+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, par_type from)
+{
+ recordUndo(kind, cur, cur.par(), from);
+}
+
+
+void recordUndo(LCursor & cur, Undo::undo_kind kind,
+ par_type from, par_type to)
+{
+ recordUndo(kind, cur, from, to);
+}
+
+
+void recordUndoFullDocument(LCursor &)
+{
+ //recordUndo(Undo::ATOMIC,
+ // cur, 0, cur.bv().text()->paragraphs().size() - 1);
}
projects / lyx.git / blobdiff