blob: 656eecd7432b2069b6c5c91fa013a9914035c0bb (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
// Copyright (c) AlphaSierraPapa for the SharpDevelop Team (for details please see \doc\copyright.txt)
// This code is distributed under the GNU LGPL (for details please see \doc\license.txt)
using System;
using System.Diagnostics;
using ICSharpCode.AvalonEdit.Utils;
namespace ICSharpCode.AvalonEdit.Document
{
/// <summary>
/// This class stacks the last x operations from the undostack and makes
/// one undo/redo operation from it.
/// </summary>
sealed class UndoOperationGroup : IUndoableOperationWithContext
{
IUndoableOperation[] undolist;
public UndoOperationGroup(Deque<IUndoableOperation> stack, int numops)
{
if (stack == null) {
throw new ArgumentNullException("stack");
}
Debug.Assert(numops > 0 , "UndoOperationGroup : numops should be > 0");
Debug.Assert(numops <= stack.Count);
undolist = new IUndoableOperation[numops];
for (int i = 0; i < numops; ++i) {
undolist[i] = stack.PopBack();
}
}
public void Undo()
{
for (int i = 0; i < undolist.Length; ++i) {
undolist[i].Undo();
}
}
public void Undo(UndoStack stack)
{
for (int i = 0; i < undolist.Length; ++i) {
stack.RunUndo(undolist[i]);
}
}
public void Redo()
{
for (int i = undolist.Length - 1; i >= 0; --i) {
undolist[i].Redo();
}
}
public void Redo(UndoStack stack)
{
for (int i = undolist.Length - 1; i >= 0; --i) {
stack.RunRedo(undolist[i]);
}
}
}
}
|
