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
|
/*************************************************************************
* Copyright © 2012-2018 Vincent Prat & Simon Nicolas
*
* 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 3 of the License, or
* (at your option) any later version.
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*************************************************************************/
#ifndef HEADER_MODIFICATIONQUEUE
#define HEADER_MODIFICATIONQUEUE
#include <vector>
#include "Modification.h"
/*!
* \brief Queue of modifications
*/
class ModificationQueue
{
public:
/*!
* \brief Constructor
*/
ModificationQueue();
/*!
* \brief Destructor
*/
~ModificationQueue();
/*!
* \brief Clearing method
*
* Deletes all the modifications and clears the container
*/
void clear();
/*!
* \brief Addition method
* \param modification New modification
*
* Deletes undone modifications and adds the new one
*/
void add(Modification *modification);
/*!
* \brief Undoing
* \return Just undone modification (0 if none)
*
* Undoes the last (done or redone) modification
*/
Modification* undo();
/*!
* \brief Redoing
* \return Just redone modification (0 if none)
*
* Redoes the last undone modification
*/
Modification* redo();
/*!
* \brief Test of undo-ability
* \return True if there is something to undo, false otherwise
*/
bool undoable() const;
/*!
* \brief Test of redo-ability
* \return True if there is something to redo, false otherwise
*/
bool redoable() const;
/*!
* \brief Test if the last modification has been saved
* \return True if the last modification has been saved, false otherwise
*/
bool isUpToDate() const;
/*!
* \brief Save the last modification
*/
void save();
private:
//! Container for the modifications
std::vector<Modification*> vModifs;
//! Number of applied modification
int iCurrent;
//! Number of saved modification
int iSaved;
};
inline bool ModificationQueue::undoable() const
{
return (iCurrent > 0);
}
inline bool ModificationQueue::redoable() const
{
return (iCurrent < vModifs.size());
}
inline bool ModificationQueue::isUpToDate() const
{
return (iCurrent == iSaved);
}
inline void ModificationQueue::save()
{
iSaved = iCurrent;
}
#endif
|
