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
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/
**
** This file is part of the QtDeclarative module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QDECLARATIVECHANGESET_P_H
#define QDECLARATIVECHANGESET_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include <QtCore/qdebug.h>
#include <QtCore/qvector.h>
QT_BEGIN_NAMESPACE
class Q_AUTOTEST_EXPORT QDeclarativeChangeSet
{
public:
struct MoveKey
{
MoveKey() : moveId(-1), offset(0) {}
MoveKey(int moveId, int offset) : moveId(moveId), offset(offset) {}
int moveId;
int offset;
};
struct Change
{
Change() : index(0), count(0), moveId(-1) {}
Change(int index, int count) : index(index), count(count), moveId(-1) {}
Change(int index, int count, int moveId) : index(index), count(count), moveId(moveId) {}
int index;
int count;
int moveId;
bool isMove() const { return moveId >= 0; }
MoveKey moveKey(int index) const { return MoveKey(moveId, index - Change::index); }
int start() const { return index; }
int end() const { return index + count; }
};
struct Insert : public Change
{
Insert() {}
Insert(int index, int count) : Change(index, count) {}
Insert(int index, int count, int moveId) : Change(index, count, moveId) {}
};
struct Remove : public Change
{
Remove() {}
Remove(int index, int count) : Change(index, count) {}
Remove(int index, int count, int moveId) : Change(index, count, moveId) {}
};
QDeclarativeChangeSet();
QDeclarativeChangeSet(const QDeclarativeChangeSet &changeSet);
~QDeclarativeChangeSet();
QDeclarativeChangeSet &operator =(const QDeclarativeChangeSet &changeSet);
const QVector<Remove> &removes() const { return m_removes; }
const QVector<Insert> &inserts() const { return m_inserts; }
const QVector<Change> &changes() const {return m_changes; }
void insert(int index, int count);
void remove(int index, int count);
void move(int from, int to, int count);
void change(int index, int count);
void apply(const QDeclarativeChangeSet &changeSet);
void apply(const QVector<Remove> &removals);
void apply(const QVector<Insert> &insertions);
void apply(const QVector<Change> &changes);
void apply(
const QVector<Remove> &removals,
const QVector<Insert> &insertions,
const QVector<Change> &changes = QVector<Change>());
bool isEmpty() const { return m_removes.empty() && m_inserts.empty() && m_changes.empty(); }
void clear()
{
m_removes.clear();
m_inserts.clear();
m_changes.clear();
m_moveCounter = 0;
m_difference = 0;
}
int moveCounter() const { return m_moveCounter; }
int difference() const { return m_difference; }
private:
void applyRemovals(QVector<Remove> &removals, QVector<Insert> &insertions);
void applyInsertions(QVector<Insert> &insertions);
void applyChanges(QVector<Change> &changes);
QVector<Remove> m_removes;
QVector<Insert> m_inserts;
QVector<Change> m_changes;
int m_moveCounter;
int m_difference;
};
inline uint qHash(const QDeclarativeChangeSet::MoveKey &key) { return qHash(qMakePair(key.moveId, key.offset)); }
inline bool operator ==(const QDeclarativeChangeSet::MoveKey &l, const QDeclarativeChangeSet::MoveKey &r) {
return l.moveId == r.moveId && l.offset == r.offset; }
Q_AUTOTEST_EXPORT QDebug operator <<(QDebug debug, const QDeclarativeChangeSet &change);
Q_AUTOTEST_EXPORT QDebug operator <<(QDebug debug, const QDeclarativeChangeSet::Remove &remove);
Q_AUTOTEST_EXPORT QDebug operator <<(QDebug debug, const QDeclarativeChangeSet::Insert &insert);
Q_AUTOTEST_EXPORT QDebug operator <<(QDebug debug, const QDeclarativeChangeSet::Change &change);
QT_END_NAMESPACE
#endif
|
