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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, 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.0, 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.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://qt.nokia.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QFILESYSTEMMODEL_P_H
#define QFILESYSTEMMODEL_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 "qfilesystemmodel.h"
#ifndef QT_NO_FILESYSTEMMODEL
#include <private/qabstractitemmodel_p.h>
#include <qabstractitemmodel.h>
#include "qfileinfogatherer_p.h"
#include <qpair.h>
#include <qdir.h>
#include <qicon.h>
#include <qdir.h>
#include <qicon.h>
#include <qfileinfo.h>
#include <qtimer.h>
#include <qhash.h>
QT_BEGIN_NAMESPACE
class ExtendedInformation;
class QFileSystemModelPrivate;
class QFileIconProvider;
class Q_AUTOTEST_EXPORT QFileSystemModelPrivate : public QAbstractItemModelPrivate
{
Q_DECLARE_PUBLIC(QFileSystemModel)
public:
class QFileSystemNode
{
public:
QFileSystemNode(const QString &filename = QString(), QFileSystemNode *p = 0)
: fileName(filename), populatedChildren(false), isVisible(false), parent(p), info(0) {}
~QFileSystemNode() {
QHash<QString, QFileSystemNode*>::const_iterator i = children.constBegin();
while (i != children.constEnd()) {
delete i.value();
++i;
}
delete info;
info = 0;
parent = 0;
}
QString fileName;
inline qint64 size() const { if (info && !info->isDir()) return info->size(); return 0; }
inline QString type() const { if (info) return info->displayType; return QLatin1String(""); }
inline QDateTime lastModified() const { if (info) return info->lastModified(); return QDateTime(); }
inline QFile::Permissions permissions() const { if (info) return info->permissions(); return 0; }
inline bool isReadable() const { return ((permissions() & QFile::ReadUser) != 0); }
inline bool isWritable() const { return ((permissions() & QFile::WriteUser) != 0); }
inline bool isExecutable() const { return ((permissions() & QFile::ExeUser) != 0); }
inline bool isDir() const {
if (info)
return info->isDir();
if (children.count() > 0)
return true;
return false;
}
inline bool isFile() const { if (info) return info->isFile(); return true; }
inline bool isSystem() const { if (info) return info->isSystem(); return true; }
inline bool isHidden() const { if (info) return info->isHidden(); return false; }
inline bool isSymLink() const { if (info) return info->isSymLink(); return false; }
inline bool caseSensitive() const { if (info) return info->isCaseSensitive(); return false; }
inline QIcon icon() const { if (info) return info->icon; return QIcon(); }
inline bool operator <(const QFileSystemNode &node) const {
if (caseSensitive() || node.caseSensitive())
return fileName < node.fileName;
return QString::compare(fileName, node.fileName, Qt::CaseInsensitive) < 0;
}
inline bool operator >(const QString &name) const {
if (caseSensitive())
return fileName > name;
return QString::compare(fileName, name, Qt::CaseInsensitive) > 0;
}
inline bool operator <(const QString &name) const {
if (caseSensitive())
return fileName < name;
return QString::compare(fileName, name, Qt::CaseInsensitive) < 0;
}
inline bool operator !=(const QExtendedInformation &fileInfo) const {
return !operator==(fileInfo);
}
bool operator ==(const QString &name) const {
if (caseSensitive())
return fileName == name;
return QString::compare(fileName, name, Qt::CaseInsensitive) == 0;
}
bool operator ==(const QExtendedInformation &fileInfo) const {
return info && (*info == fileInfo);
}
inline bool hasInformation() const { return info != 0; }
void populate(const QExtendedInformation &fileInfo) {
if (!info)
info = new QExtendedInformation(fileInfo.fileInfo());
(*info) = fileInfo;
}
// children shouldn't normally be accessed directly, use node()
inline int visibleLocation(QString childName) {
return visibleChildren.indexOf(childName);
}
void updateIcon(QFileIconProvider *iconProvider, const QString &path) {
if (info)
info->icon = iconProvider->icon(QFileInfo(path));
QHash<QString, QFileSystemNode *>::const_iterator iterator;
for(iterator = children.constBegin() ; iterator != children.constEnd() ; ++iterator) {
//On windows the root (My computer) has no path so we don't want to add a / for nothing (e.g. /C:/)
if (!path.isEmpty()) {
if (path.endsWith(QLatin1Char('/')))
iterator.value()->updateIcon(iconProvider, path + iterator.value()->fileName);
else
iterator.value()->updateIcon(iconProvider, path + QLatin1Char('/') + iterator.value()->fileName);
} else
iterator.value()->updateIcon(iconProvider, iterator.value()->fileName);
}
}
void retranslateStrings(QFileIconProvider *iconProvider, const QString &path) {
if (info)
info->displayType = iconProvider->type(QFileInfo(path));
QHash<QString, QFileSystemNode *>::const_iterator iterator;
for(iterator = children.constBegin() ; iterator != children.constEnd() ; ++iterator) {
//On windows the root (My computer) has no path so we don't want to add a / for nothing (e.g. /C:/)
if (!path.isEmpty()) {
if (path.endsWith(QLatin1Char('/')))
iterator.value()->retranslateStrings(iconProvider, path + iterator.value()->fileName);
else
iterator.value()->retranslateStrings(iconProvider, path + QLatin1Char('/') + iterator.value()->fileName);
} else
iterator.value()->retranslateStrings(iconProvider, iterator.value()->fileName);
}
}
bool populatedChildren;
bool isVisible;
QHash<QString,QFileSystemNode *> children;
QList<QString> visibleChildren;
QFileSystemNode *parent;
QExtendedInformation *info;
};
QFileSystemModelPrivate() :
forceSort(true),
sortColumn(0),
sortOrder(Qt::AscendingOrder),
readOnly(true),
setRootPath(false),
filters(QDir::AllEntries | QDir::NoDotAndDotDot | QDir::AllDirs),
nameFilterDisables(true), // false on windows, true on mac and unix
disableRecursiveSort(false)
{
delayedSortTimer.setSingleShot(true);
}
void init();
/*
\internal
Return true if index which is owned by node is hidden by the filter.
*/
inline bool isHiddenByFilter(QFileSystemNode *indexNode, const QModelIndex &index) const
{
return (indexNode != &root && !index.isValid());
}
QFileSystemNode *node(const QModelIndex &index) const;
QFileSystemNode *node(const QString &path, bool fetch = true) const;
inline QModelIndex index(const QString &path) { return index(node(path)); }
QModelIndex index(const QFileSystemNode *node) const;
bool filtersAcceptsNode(const QFileSystemNode *node) const;
bool passNameFilters(const QFileSystemNode *node) const;
void removeNode(QFileSystemNode *parentNode, const QString &name);
QFileSystemNode* addNode(QFileSystemNode *parentNode, const QString &fileName, const QFileInfo &info);
void addVisibleFiles(QFileSystemNode *parentNode, const QStringList &newFiles);
void removeVisibleFile(QFileSystemNode *parentNode, int visibleLocation);
void sortChildren(int column, const QModelIndex &parent);
inline int translateVisibleLocation(QFileSystemNode *parent, int row) const {
return (sortOrder == Qt::AscendingOrder) ? row : parent->visibleChildren.count() - row - 1;
}
inline static QString myComputer() {
// ### TODO We should query the system to find out what the string should be
// XP == "My Computer",
// Vista == "Computer",
// OS X == "Computer" (sometime user generated) "Benjamin's PowerBook G4"
#ifdef Q_OS_WIN
return QFileSystemModel::tr("My Computer");
#else
return QFileSystemModel::tr("Computer");
#endif
}
inline void delayedSort() {
if (!delayedSortTimer.isActive())
delayedSortTimer.start(0);
}
static bool caseInsensitiveLessThan(const QString &s1, const QString &s2)
{
return QString::compare(s1, s2, Qt::CaseInsensitive) < 0;
}
static bool nodeCaseInsensitiveLessThan(const QFileSystemModelPrivate::QFileSystemNode &s1, const QFileSystemModelPrivate::QFileSystemNode &s2)
{
return QString::compare(s1.fileName, s2.fileName, Qt::CaseInsensitive) < 0;
}
QIcon icon(const QModelIndex &index) const;
QString name(const QModelIndex &index) const;
QString filePath(const QModelIndex &index) const;
QString size(const QModelIndex &index) const;
static QString size(qint64 bytes);
QString type(const QModelIndex &index) const;
QString time(const QModelIndex &index) const;
void _q_directoryChanged(const QString &directory, const QStringList &list);
void _q_performDelayedSort();
void _q_fileSystemChanged(const QString &path, const QList<QPair<QString, QFileInfo> > &);
void _q_resolvedName(const QString &fileName, const QString &resolvedName);
static int naturalCompare(const QString &s1, const QString &s2, Qt::CaseSensitivity cs);
QDir rootDir;
#ifndef QT_NO_FILESYSTEMWATCHER
QFileInfoGatherer fileInfoGatherer;
#endif
QTimer delayedSortTimer;
bool forceSort;
int sortColumn;
Qt::SortOrder sortOrder;
bool readOnly;
bool setRootPath;
QDir::Filters filters;
QHash<const QFileSystemNode*, bool> bypassFilters;
bool nameFilterDisables;
//This flag is an optimization for the QFileDialog
//It enable a sort which is not recursive, it means
//we sort only what we see.
bool disableRecursiveSort;
#ifndef QT_NO_REGEXP
QList<QRegExp> nameFilters;
#endif
// ### Qt 5: resolvedSymLinks goes away
QHash<QString, QString> resolvedSymLinks;
QFileSystemNode root;
QBasicTimer fetchingTimer;
struct Fetching {
QString dir;
QString file;
const QFileSystemNode *node;
};
QList<Fetching> toFetch;
};
#endif // QT_NO_FILESYSTEMMODEL
QT_END_NAMESPACE
#endif
|