2 Copyright (C) 2001 Brett Viren & Paul Davis
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
27 #include "pbd/xml++.h"
29 #include <sigc++/bind.h>
34 UndoTransaction::UndoTransaction ()
37 gettimeofday (&_timestamp, 0);
40 UndoTransaction::UndoTransaction (const UndoTransaction& rhs)
42 , PBD::ScopedConnectionList ()
46 actions.insert(actions.end(),rhs.actions.begin(),rhs.actions.end());
49 UndoTransaction::~UndoTransaction ()
56 command_death (UndoTransaction* ut, Command* c)
62 ut->remove_command (c);
70 UndoTransaction::operator= (const UndoTransaction& rhs)
72 if (this == &rhs) return *this;
75 actions.insert(actions.end(),rhs.actions.begin(),rhs.actions.end());
80 UndoTransaction::add_command (Command *const action)
82 /* catch death of command (e.g. caused by death of object to
83 which it refers. command_death() is a normal static function
84 so there is no need to manage this connection.
87 action->DropReferences.connect_same_thread (*this, boost::bind (&command_death, this, action));
88 actions.push_back (action);
92 UndoTransaction::remove_command (Command* const action)
94 actions.remove (action);
98 UndoTransaction::empty () const
100 return actions.empty();
104 UndoTransaction::clear ()
107 for (list<Command*>::iterator i = actions.begin(); i != actions.end(); ++i) {
115 UndoTransaction::operator() ()
117 for (list<Command*>::iterator i = actions.begin(); i != actions.end(); ++i) {
123 UndoTransaction::undo ()
125 struct timeval start, end, diff;
126 gettimeofday (&start, 0);
127 for (list<Command*>::reverse_iterator i = actions.rbegin(); i != actions.rend(); ++i) {
130 gettimeofday (&end, 0);
131 timersub (&end, &start, &diff);
132 cerr << "Undo took " << diff.tv_sec << '.' << diff.tv_usec << endl;
136 UndoTransaction::redo ()
138 struct timeval start, end, diff;
139 gettimeofday (&start, 0);
141 gettimeofday (&end, 0);
142 timersub (&end, &start, &diff);
143 cerr << "Undo took " << diff.tv_sec << '.' << diff.tv_usec << endl;
146 XMLNode &UndoTransaction::get_state()
148 XMLNode *node = new XMLNode ("UndoTransaction");
150 ss << _timestamp.tv_sec;
151 node->add_property("tv_sec", ss.str());
153 ss << _timestamp.tv_usec;
154 node->add_property("tv_usec", ss.str());
155 node->add_property("name", _name);
157 list<Command*>::iterator it;
158 for (it=actions.begin(); it!=actions.end(); it++)
159 node->add_child_nocopy((*it)->get_state());
164 UndoHistory::UndoHistory ()
171 UndoHistory::set_depth (uint32_t d)
174 uint32_t current_depth = UndoList.size();
178 if (d > current_depth) {
179 /* not even transactions to meet request */
185 uint32_t cnt = current_depth - d;
188 ut = UndoList.front();
189 UndoList.pop_front ();
196 UndoHistory::add (UndoTransaction* const ut)
198 uint32_t current_depth = UndoList.size();
200 ut->DropReferences.connect_same_thread (*this, boost::bind (&UndoHistory::remove, this, ut));
202 /* if the current undo history is larger than or equal to the currently
203 requested depth, then pop off at least 1 element to make space
204 at the back for new one.
207 if ((_depth > 0) && current_depth && (current_depth >= _depth)) {
209 uint32_t cnt = 1 + (current_depth - _depth);
213 ut = UndoList.front ();
214 UndoList.pop_front ();
219 UndoList.push_back (ut);
221 /* we are now owners of the transaction and must delete it when finished with it */
223 Changed (); /* EMIT SIGNAL */
227 UndoHistory::remove (UndoTransaction* const ut)
233 UndoList.remove (ut);
234 RedoList.remove (ut);
236 Changed (); /* EMIT SIGNAL */
239 /** Undo some transactions.
240 * @param n Number of transactions to undo.
243 UndoHistory::undo (unsigned int n)
246 if (UndoList.size() == 0) {
249 UndoTransaction* ut = UndoList.back ();
250 UndoList.pop_back ();
252 RedoList.push_back (ut);
255 Changed (); /* EMIT SIGNAL */
259 UndoHistory::redo (unsigned int n)
262 if (RedoList.size() == 0) {
265 UndoTransaction* ut = RedoList.back ();
266 RedoList.pop_back ();
268 UndoList.push_back (ut);
271 Changed (); /* EMIT SIGNAL */
275 UndoHistory::clear_redo ()
281 Changed (); /* EMIT SIGNAL */
286 UndoHistory::clear_undo ()
292 Changed (); /* EMIT SIGNAL */
296 UndoHistory::clear ()
301 Changed (); /* EMIT SIGNAL */
305 UndoHistory::get_state (int32_t depth)
307 XMLNode *node = new XMLNode ("UndoHistory");
313 } else if (depth < 0) {
317 for (list<UndoTransaction*>::iterator it = UndoList.begin(); it != UndoList.end(); ++it) {
318 node->add_child_nocopy((*it)->get_state());
323 /* just the last "depth" transactions */
325 list<UndoTransaction*> in_order;
327 for (list<UndoTransaction*>::reverse_iterator it = UndoList.rbegin(); it != UndoList.rend() && depth; ++it, depth--) {
328 in_order.push_front (*it);
331 for (list<UndoTransaction*>::iterator it = in_order.begin(); it != in_order.end(); it++) {
332 node->add_child_nocopy((*it)->get_state());