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
|
/*
* Copyright (c) 2005 Casper Boemann <cbr@boemann.dk>
*
* 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.
*
* 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 KIS_MEMENTO_H_
#define KIS_MEMENTO_H_
#include <qglobal.h>
#include <qrect.h>
#include <ksharedptr.h>
class KisTile;
class KisTiledDataManager;
class KisMemento;
typedef KSharedPtr<KisMemento> KisMementoSP;
class KisMemento : public KShared
{
public:
KisMemento(Q_UINT32 pixelSize);
~KisMemento();
/*
// For consolidating transactions
virtual KisTransaction &operator+=(const KisTransaction &) = 0;
// For consolidating transactions
virtual KisTransaction &operator+(const KisTransaction &,
const KisTransaction &) = 0;
*/
void extent(Q_INT32 &x, Q_INT32 &y, Q_INT32 &w, Q_INT32 &h) const;
QRect extent() const;
bool containsTile(Q_INT32 col, Q_INT32 row, Q_UINT32 tileHash) const;
// For debugging use
bool valid() const { return m_valid; }
void setInvalid() { m_valid = false; }
private:
class DeletedTile {
public:
DeletedTile(Q_INT32 col, Q_INT32 row, const DeletedTile *next)
: m_col(col),
m_row(row),
m_next(next)
{
}
Q_INT32 col() const { return m_col; }
Q_INT32 row() const { return m_row; }
const DeletedTile *next() const { return m_next; }
private:
Q_INT32 m_col;
Q_INT32 m_row;
const DeletedTile *m_next;
};
class DeletedTileList {
public:
DeletedTileList()
: m_firstDeletedTile(0)
{
}
~DeletedTileList();
void addTile(Q_INT32 col, Q_INT32 row)
{
DeletedTile *d = new DeletedTile(col, row, m_firstDeletedTile);
Q_CHECK_PTR(d);
m_firstDeletedTile = d;
}
DeletedTile *firstTile() const
{
return m_firstDeletedTile;
}
void clear();
private:
DeletedTile *m_firstDeletedTile;
};
void addTileToDeleteOnRedo(Q_INT32 col, Q_INT32 row)
{
m_redoDelTilesList.addTile(col, row);
}
DeletedTile *tileListToDeleteOnRedo()
{
return m_redoDelTilesList.firstTile();
}
void clearTilesToDeleteOnRedo()
{
m_redoDelTilesList.clear();
}
void addTileToDeleteOnUndo(Q_INT32 col, Q_INT32 row)
{
m_undoDelTilesList.addTile(col, row);
}
DeletedTile *tileListToDeleteOnUndo()
{
return m_undoDelTilesList.firstTile();
}
void clearTilesToDeleteOnUndo()
{
m_undoDelTilesList.clear();
}
friend class KisTiledDataManager;
KisTiledDataManager *originator;
KisTile **m_hashTable;
Q_UINT32 m_numTiles;
KisTile **m_redoHashTable;
DeletedTileList m_redoDelTilesList;
DeletedTileList m_undoDelTilesList;
Q_UINT8 *m_defPixel;
Q_UINT8 *m_redoDefPixel;
void deleteAll(KisTile *tile);
bool m_valid;
};
#endif // KIS_MEMENTO_H_
|
