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
|
/*************************************************************************
* Copyright © 2012-2020 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.
*************************************************************************/
#include "TreeModification.h"
#include "ItemFactory.h"
#include <sstream>
using namespace std;
TreeModification::TreeModification(Tree &tree, Item *newItem, const string &indices): Modification(aAddition), sIndices(indices), rTree(tree), pBranch(0), pItem(0), pNewItem(newItem), pUndoneItem(0)
{
}
TreeModification::TreeModification(Tree &tree, Branch *branch, const string &indices): Modification(aDeletion), sIndices(indices), rTree(tree), pBranch(branch), pItem(0), pNewItem(0), pUndoneItem(0)
{
}
TreeModification::TreeModification(Tree &tree, Item *item, Item *newItem, const string &indices): Modification(aEdition), etEditType(etFull), sIndices(indices), rTree(tree), pBranch(0), pItem(item), pNewItem(newItem), pUndoneItem(0)
{
}
TreeModification::TreeModification(Tree &tree, const string &content, const string &newContent, const string &indices): Modification(aEdition), etEditType(etContent), sIndices(indices), rTree(tree), pBranch(0), pItem(0), pNewItem(0), sContent(content), sNewContent(newContent), pUndoneItem(0)
{
}
TreeModification::TreeModification(Tree &tree, Item::State state, Item::State newState, const string &indices): Modification(aEdition), etEditType(etState), sIndices(indices), rTree(tree), pBranch(0), pItem(0), pNewItem(0), sState(state), sNewState(newState), pUndoneItem(0)
{
}
TreeModification::TreeModification(Tree &tree, const string &indices, const string &newIndices): Modification(aMovement), sIndices(indices), sNewIndices(newIndices), rTree(tree), pBranch(0), pItem(0), pNewItem(0), pUndoneItem(0)
{
}
TreeModification::~TreeModification()
{
if (pBranch)
{
delete pBranch;
}
if (pItem)
{
delete pItem;
}
if (pNewItem)
{
delete pNewItem;
}
if (pUndoneItem)
{
delete pUndoneItem;
}
}
void TreeModification::undo()
{
switch (action())
{
case aAddition: pUndoneItem = rTree[sIndices];
rTree.remove(sIndices, false);
break;
case aDeletion: rTree.insert(sIndices, pBranch);
pBranch = 0;
break;
case aEdition: switch (etEditType)
{
case etFull: pUndoneItem = rTree[sIndices];
pCurrentItem = ItemFactory::copyItem(pItem);
rTree.setItem(sIndices, pCurrentItem);
break;
case etContent: rTree[sIndices]->setContent(sContent);
break;
case etState: rTree[sIndices]->setState(sState);
break;
}
break;
case aMovement: rTree.move(modifiedNewIndices(), modifiedIndices());
break;
default: break;
}
}
void TreeModification::redo()
{
switch (action())
{
case aAddition: rTree.insert(sIndices, new Branch(ItemFactory::copyItem(pNewItem)));
break;
case aDeletion: pBranch = rTree.branch(sIndices);
rTree.remove(sIndices, false);
break;
case aEdition: switch (etEditType)
{
case etFull: pUndoneItem = rTree[sIndices];
pCurrentItem = ItemFactory::copyItem(pNewItem);
rTree.setItem(sIndices, pCurrentItem);
break;
case etContent: rTree[sIndices]->setContent(sNewContent);
break;
case etState: rTree[sIndices]->setState(sNewState);
break;
}
break;
case aMovement: rTree.move(sIndices, sNewIndices);
break;
default: break;
}
}
string TreeModification::modifiedIndices() const
{
// we now determine if there is need to modify sIndices for the undoing
string subNew(sNewIndices), subCurrent(sIndices);
int nNew, nCurrent;
ostringstream buf;
// we iterate over the indices
bool firstTime = true;
do
{
nNew = Tree::extractIndex(subNew);
nCurrent = Tree::extractIndex(subCurrent);
if (!firstTime)
{
buf << "_";
}
if (subNew=="" && nNew <= nCurrent)
{
// we modify the indices
buf << (nCurrent+1);
}
else
{
// we do not modify the indices of the item to remove
buf << nCurrent;
}
firstTime = false;
}
while (subNew!="" && subCurrent!="" && nNew == nCurrent);
// we add the following indices (they are unchanged)
if (subCurrent != "")
{
buf << "_" << subCurrent;
}
return buf.str();
}
string TreeModification::modifiedNewIndices() const
{
// we now determine if there is need to modify sNewIndices for the undoing
string subNew(sNewIndices), subCurrent(sIndices);
int nNew, nCurrent;
ostringstream buf;
// we iterate over the indices
bool firstTime = true;
do
{
nNew = Tree::extractIndex(subNew);
nCurrent = Tree::extractIndex(subCurrent);
if (!firstTime)
{
buf << "_";
}
if (subCurrent=="" && nCurrent <= nNew)
{
// we modify the new indices
buf << (nNew-1);
}
else
{
// we do not modify the indices of the item to remove
buf << nNew;
}
firstTime = false;
}
while (subNew!="" && subCurrent!="" && nNew == nCurrent);
// we add the following indices (they are unchanged)
if (subNew!="")
{
buf << "_" << subNew;
}
return buf.str();
}
string TreeModification::deletedIndices() const
{
string sub(sIndices);
int n;
ostringstream buf;
n = Tree::extractIndex(sub, false);
if (n == 0)
{
return sub;
}
else
{
buf << sub;
if (sub != "")
{
buf << "_";
}
buf << n-1;
return buf.str();
}
}
void TreeModification::freeUndoneItem()
{
if (pUndoneItem)
{
delete pUndoneItem;
pUndoneItem = 0;
}
}
|
