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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/**
* $Id$
* ***** BEGIN GPL/BL DUAL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version. The Blender
* Foundation also sells licenses for use in proprietary software under
* the Blender License. See http://www.blender.org/BL/ for information
* about this.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL/BL DUAL LICENSE BLOCK *****
*/
/**
* $Id$
* Copyright (C) 2001 NaN Technologies B.V.
* @author Maarten Gribnau
* @date March 31, 2001
*/
#include "ACT_ActionStack.h"
ACT_ActionStack::ACT_ActionStack(unsigned int maxStackDepth)
: m_maxStackDepth(maxStackDepth),
m_undoIndex(0), m_undoIndexValid(false),
m_redoIndex(0), m_redoIndexValid(false)
{
}
ACT_ActionStack::~ACT_ActionStack()
{
flush();
}
unsigned int ACT_ActionStack::getStackDepth() const
{
return m_stack.size();
}
unsigned int ACT_ActionStack::getMaxStackDepth() const
{
return m_maxStackDepth;
}
void ACT_ActionStack::setMaxStackDepth(unsigned int maxStackDepth)
{
if (maxStackDepth != m_maxStackDepth) {
if (maxStackDepth) {
unsigned int size = m_stack.size();
if (maxStackDepth < size) {
// New max stack size is smaller than current stack size, need to shrink stack
unsigned int numRemove = size - maxStackDepth;
if (m_undoIndex >= maxStackDepth) {
// Pop items from the front (throw away undo steps)
popFront(numRemove);
m_undoIndex -= numRemove;
m_redoIndex = m_undoIndex + 1;
m_redoIndexValid = m_redoIndexValid && (maxStackDepth > 1);
}
else {
// Pop items from the back (throw away redo steps)
popBack(numRemove);
m_redoIndexValid = m_redoIndexValid && (m_redoIndex < maxStackDepth);
}
}
}
else {
// New stack size is zero
flush();
}
m_maxStackDepth = maxStackDepth;
}
}
void ACT_ActionStack::push(ACT_Action& action)
{
if (m_maxStackDepth) {
unsigned int size = m_stack.size();
if (m_redoIndexValid) {
// Remove items after the current action (throw away redo steps)
popBack(size - m_redoIndex);
}
else if (size >= m_maxStackDepth) {
// Remove items from the front (throw away undo steps)
popFront(m_maxStackDepth - size + 1);
}
// Store the action
if (!action.getIsApplied()) {
action.apply();
}
action.incRef();
m_stack.push_back(&action);
// Update action indices
m_redoIndex = m_stack.size();
m_redoIndexValid = false;
m_undoIndex = m_redoIndex - 1;
m_undoIndexValid = true;
}
}
ACT_Action* ACT_ActionStack::peekUndo()
{
unsigned int i;
return getUndoIndex(i) ? m_stack[i] : 0;
}
ACT_Action* ACT_ActionStack::peekRedo()
{
unsigned int i;
return getRedoIndex(i) ? m_stack[i] : 0;
}
void ACT_ActionStack::flush()
{
popBack(m_stack.size());
m_undoIndex = 0;
m_undoIndexValid = false;
m_redoIndex = 0;
m_redoIndexValid = false;
}
bool ACT_ActionStack::canUndo() const
{
unsigned int i;
return getUndoIndex(i);
}
void ACT_ActionStack::undo()
{
ACT_Action* action = peekUndo();
if (action) {
action->undo();
// Update action indices
m_redoIndex = m_undoIndex;
m_redoIndexValid = true;
if (m_undoIndex) {
m_undoIndex--;
}
else {
m_undoIndexValid = false;
}
}
}
bool ACT_ActionStack::canRedo() const
{
unsigned int i;
return getRedoIndex(i);
}
void ACT_ActionStack::redo()
{
ACT_Action* action = peekRedo();
if (action) {
action->apply();
// Update action indices
m_undoIndex = m_redoIndex;
m_undoIndexValid = true;
m_redoIndex++;
m_redoIndexValid = m_redoIndex < m_stack.size();
}
}
unsigned int ACT_ActionStack::popFront(unsigned int numActions)
{
unsigned int numRemoved = 0;
while (numActions-- && m_stack.size()) {
ACT_Action* action = m_stack[0];
action->decRef();
m_stack.pop_front();
numRemoved++;
}
return numRemoved;
}
unsigned int ACT_ActionStack::popBack(unsigned int numActions)
{
unsigned int numRemoved = 0;
unsigned int size;
while (numActions-- && (size = m_stack.size())) {
ACT_Action* action = m_stack[size-1];
action->decRef();
m_stack.pop_back();
numRemoved++;
}
return numRemoved;
}
bool ACT_ActionStack::getUndoIndex(unsigned int& i) const
{
i = m_undoIndex;
return m_undoIndexValid;
}
bool ACT_ActionStack::getRedoIndex(unsigned int& i) const
{
i = m_redoIndex;
return m_redoIndexValid;
}
|
