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
|
/* This file is part of the KDE project
* Copyright (c) 2004 Casper Boemann <[email protected]>
*
* 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.
*/
#include <tqglobal.h>
#include <kdebug.h>
#include "kis_iterator.h"
#include "kis_datamanager.h"
#include "kis_tilediterator.h"
KisRectIterator::KisRectIterator ( KisDataManager *dm, TQ_INT32 x, TQ_INT32 y, TQ_INT32 w, TQ_INT32 h, bool writable)
{
m_iter = new KisTiledRectIterator(dm, x, y, w, h, writable);
}
KisRectIterator::KisRectIterator(const KisRectIterator& rhs)
{
m_iter = rhs.m_iter;
}
KisRectIterator& KisRectIterator::operator=(const KisRectIterator& rhs)
{
m_iter = rhs.m_iter;
return *this;
}
KisRectIterator::~KisRectIterator()
{
}
TQ_UINT8 * KisRectIterator::rawData() const { return m_iter->rawData();}
const TQ_UINT8 * KisRectIterator::oldRawData() const { return m_iter->oldRawData();}
TQ_INT32 KisRectIterator::nConseqPixels() const { return m_iter->nConseqPixels(); }
KisRectIterator & KisRectIterator::operator+=(int n) { m_iter->operator+=(n); return *this; }
KisRectIterator & KisRectIterator::operator++() { m_iter->operator++(); return *this; }
bool KisRectIterator::isDone() const { return m_iter->isDone(); }
TQ_INT32 KisRectIterator::x() const { return m_iter->x(); }
TQ_INT32 KisRectIterator::y() const { return m_iter->y(); }
//---------------------------------------------------------------------------------------
KisHLineIterator::KisHLineIterator ( KisDataManager *dm, TQ_INT32 x, TQ_INT32 y, TQ_INT32 w, bool writable)
{
m_iter = new KisTiledHLineIterator(dm, x, y, w, writable);
}
KisHLineIterator::KisHLineIterator(const KisHLineIterator& rhs)
{
m_iter = rhs.m_iter;
}
KisHLineIterator& KisHLineIterator::operator=(const KisHLineIterator& rhs)
{
m_iter=rhs.m_iter;
return *this;
}
KisHLineIterator::~KisHLineIterator()
{
}
TQ_UINT8 *KisHLineIterator::rawData() const
{
return m_iter->rawData();
}
const TQ_UINT8 *KisHLineIterator::oldRawData() const { return m_iter->oldRawData();}
KisHLineIterator & KisHLineIterator::operator++() { m_iter->operator++(); return *this; }
TQ_INT32 KisHLineIterator::nConseqHPixels() const { return m_iter->nConseqHPixels(); }
KisHLineIterator & KisHLineIterator::operator+=(int n) { m_iter->operator+=(n); return *this; }
KisHLineIterator & KisHLineIterator::operator--() { m_iter->operator--(); return *this; }
bool KisHLineIterator::isDone() const { return m_iter->isDone(); }
TQ_INT32 KisHLineIterator::x() const { return m_iter->x(); }
TQ_INT32 KisHLineIterator::y() const { return m_iter->y(); }
void KisHLineIterator::nextRow() { m_iter->nextRow(); }
//---------------------------------------------------------------------------------------
KisVLineIterator::KisVLineIterator ( KisDataManager *dm, TQ_INT32 x, TQ_INT32 y, TQ_INT32 h, bool writable)
{
m_iter = new KisTiledVLineIterator(dm, x, y, h, writable);
}
KisVLineIterator::KisVLineIterator(const KisVLineIterator& rhs)
{
m_iter = rhs.m_iter;
}
KisVLineIterator& KisVLineIterator::operator=(const KisVLineIterator& rhs)
{
m_iter = rhs.m_iter;
return *this;
}
KisVLineIterator::~KisVLineIterator()
{
}
TQ_UINT8 *KisVLineIterator::rawData() const { return m_iter->rawData();}
const TQ_UINT8 * KisVLineIterator::oldRawData() const { return m_iter->oldRawData();}
KisVLineIterator & KisVLineIterator::operator++() { m_iter->operator++(); return *this; }
bool KisVLineIterator::isDone() const { return m_iter->isDone(); }
TQ_INT32 KisVLineIterator::x() const { return m_iter->x(); }
TQ_INT32 KisVLineIterator::y() const { return m_iter->y(); }
void KisVLineIterator::nextCol() { return m_iter->nextCol(); }
|
