1 /***************************************************************************
2 * Copyright (C) 2011 by Peter Penz <peter.penz19@gmail.com> *
4 * This program is free software; you can redistribute it and/or modify *
5 * it under the terms of the GNU General Public License as published by *
6 * the Free Software Foundation; either version 2 of the License, or *
7 * (at your option) any later version. *
9 * This program is distributed in the hope that it will be useful, *
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
12 * GNU General Public License for more details. *
14 * You should have received a copy of the GNU General Public License *
15 * along with this program; if not, write to the *
16 * Free Software Foundation, Inc., *
17 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *
18 ***************************************************************************/
20 #include "kfileitemmodel.h"
23 #include <KGlobalSettings>
25 #include <KStringHandler>
28 #include "private/kfileitemmodelsortalgorithm.h"
29 #include "private/kfileitemmodeldirlister.h"
31 #include <QApplication>
36 // #define KFILEITEMMODEL_DEBUG
38 KFileItemModel::KFileItemModel(QObject
* parent
) :
39 KItemModelBase("text", parent
),
41 m_naturalSorting(KGlobalSettings::naturalSorting()),
42 m_sortDirsFirst(true),
44 m_sortingProgressPercent(-1),
46 m_caseSensitivity(Qt::CaseInsensitive
),
52 m_maximumUpdateIntervalTimer(0),
53 m_resortAllItemsTimer(0),
54 m_pendingItemsToInsert(),
56 m_expandedParentsCountRoot(UninitializedExpandedParentsCountRoot
),
60 m_dirLister
= new KFileItemModelDirLister(this);
61 m_dirLister
->setDelayedMimeTypes(true);
63 const QWidget
* parentWidget
= qobject_cast
<QWidget
*>(parent
);
65 m_dirLister
->setMainWindow(parentWidget
->window());
68 connect(m_dirLister
, SIGNAL(started(KUrl
)), this, SIGNAL(directoryLoadingStarted()));
69 connect(m_dirLister
, SIGNAL(canceled()), this, SLOT(slotCanceled()));
70 connect(m_dirLister
, SIGNAL(completed(KUrl
)), this, SLOT(slotCompleted()));
71 connect(m_dirLister
, SIGNAL(newItems(KFileItemList
)), this, SLOT(slotNewItems(KFileItemList
)));
72 connect(m_dirLister
, SIGNAL(itemsDeleted(KFileItemList
)), this, SLOT(slotItemsDeleted(KFileItemList
)));
73 connect(m_dirLister
, SIGNAL(refreshItems(QList
<QPair
<KFileItem
,KFileItem
> >)), this, SLOT(slotRefreshItems(QList
<QPair
<KFileItem
,KFileItem
> >)));
74 connect(m_dirLister
, SIGNAL(clear()), this, SLOT(slotClear()));
75 connect(m_dirLister
, SIGNAL(clear(KUrl
)), this, SLOT(slotClear(KUrl
)));
76 connect(m_dirLister
, SIGNAL(infoMessage(QString
)), this, SIGNAL(infoMessage(QString
)));
77 connect(m_dirLister
, SIGNAL(errorMessage(QString
)), this, SIGNAL(errorMessage(QString
)));
78 connect(m_dirLister
, SIGNAL(redirection(KUrl
,KUrl
)), this, SIGNAL(directoryRedirection(KUrl
,KUrl
)));
79 connect(m_dirLister
, SIGNAL(urlIsFileError(KUrl
)), this, SIGNAL(urlIsFileError(KUrl
)));
81 // Apply default roles that should be determined
83 m_requestRole
[NameRole
] = true;
84 m_requestRole
[IsDirRole
] = true;
85 m_requestRole
[IsLinkRole
] = true;
86 m_roles
.insert("text");
87 m_roles
.insert("isDir");
88 m_roles
.insert("isLink");
90 // For slow KIO-slaves like used for searching it makes sense to show results periodically even
91 // before the completed() or canceled() signal has been emitted.
92 m_maximumUpdateIntervalTimer
= new QTimer(this);
93 m_maximumUpdateIntervalTimer
->setInterval(2000);
94 m_maximumUpdateIntervalTimer
->setSingleShot(true);
95 connect(m_maximumUpdateIntervalTimer
, SIGNAL(timeout()), this, SLOT(dispatchPendingItemsToInsert()));
97 // When changing the value of an item which represents the sort-role a resorting must be
98 // triggered. Especially in combination with KFileItemModelRolesUpdater this might be done
99 // for a lot of items within a quite small timeslot. To prevent expensive resortings the
100 // resorting is postponed until the timer has been exceeded.
101 m_resortAllItemsTimer
= new QTimer(this);
102 m_resortAllItemsTimer
->setInterval(500);
103 m_resortAllItemsTimer
->setSingleShot(true);
104 connect(m_resortAllItemsTimer
, SIGNAL(timeout()), this, SLOT(resortAllItems()));
106 connect(KGlobalSettings::self(), SIGNAL(naturalSortingChanged()), this, SLOT(slotNaturalSortingChanged()));
109 KFileItemModel::~KFileItemModel()
111 qDeleteAll(m_itemData
);
115 void KFileItemModel::loadDirectory(const KUrl
& url
)
117 m_dirLister
->openUrl(url
);
120 void KFileItemModel::refreshDirectory(const KUrl
& url
)
122 m_dirLister
->openUrl(url
, KDirLister::Reload
);
125 KUrl
KFileItemModel::directory() const
127 return m_dirLister
->url();
130 void KFileItemModel::cancelDirectoryLoading()
135 int KFileItemModel::count() const
137 return m_itemData
.count();
140 QHash
<QByteArray
, QVariant
> KFileItemModel::data(int index
) const
142 if (index
>= 0 && index
< count()) {
143 return m_itemData
.at(index
)->values
;
145 return QHash
<QByteArray
, QVariant
>();
148 bool KFileItemModel::setData(int index
, const QHash
<QByteArray
, QVariant
>& values
)
150 if (index
< 0 || index
>= count()) {
154 QHash
<QByteArray
, QVariant
> currentValues
= m_itemData
.at(index
)->values
;
156 // Determine which roles have been changed
157 QSet
<QByteArray
> changedRoles
;
158 QHashIterator
<QByteArray
, QVariant
> it(values
);
159 while (it
.hasNext()) {
161 const QByteArray role
= it
.key();
162 const QVariant value
= it
.value();
164 if (currentValues
[role
] != value
) {
165 currentValues
[role
] = value
;
166 changedRoles
.insert(role
);
170 if (changedRoles
.isEmpty()) {
174 m_itemData
[index
]->values
= currentValues
;
175 if (changedRoles
.contains("text")) {
176 KUrl url
= m_itemData
[index
]->item
.url();
177 url
.setFileName(currentValues
["text"].toString());
178 m_itemData
[index
]->item
.setUrl(url
);
181 emit
itemsChanged(KItemRangeList() << KItemRange(index
, 1), changedRoles
);
183 if (changedRoles
.contains(sortRole())) {
184 m_resortAllItemsTimer
->start();
190 void KFileItemModel::setSortDirectoriesFirst(bool dirsFirst
)
192 if (dirsFirst
!= m_sortDirsFirst
) {
193 m_sortDirsFirst
= dirsFirst
;
198 bool KFileItemModel::sortDirectoriesFirst() const
200 return m_sortDirsFirst
;
203 void KFileItemModel::setShowHiddenFiles(bool show
)
205 m_dirLister
->setShowingDotFiles(show
);
206 m_dirLister
->emitChanges();
212 bool KFileItemModel::showHiddenFiles() const
214 return m_dirLister
->showingDotFiles();
217 void KFileItemModel::setShowDirectoriesOnly(bool enabled
)
219 m_dirLister
->setDirOnlyMode(enabled
);
222 bool KFileItemModel::showDirectoriesOnly() const
224 return m_dirLister
->dirOnlyMode();
227 QMimeData
* KFileItemModel::createMimeData(const QSet
<int>& indexes
) const
229 QMimeData
* data
= new QMimeData();
231 // The following code has been taken from KDirModel::mimeData()
232 // (kdelibs/kio/kio/kdirmodel.cpp)
233 // Copyright (C) 2006 David Faure <faure@kde.org>
235 KUrl::List mostLocalUrls
;
236 bool canUseMostLocalUrls
= true;
238 QSetIterator
<int> it(indexes
);
239 while (it
.hasNext()) {
240 const int index
= it
.next();
241 const KFileItem item
= fileItem(index
);
242 if (!item
.isNull()) {
246 mostLocalUrls
<< item
.mostLocalUrl(isLocal
);
248 canUseMostLocalUrls
= false;
253 const bool different
= canUseMostLocalUrls
&& mostLocalUrls
!= urls
;
254 urls
= KDirModel::simplifiedUrlList(urls
); // TODO: Check if we still need KDirModel for this in KDE 5.0
256 mostLocalUrls
= KDirModel::simplifiedUrlList(mostLocalUrls
);
257 urls
.populateMimeData(mostLocalUrls
, data
);
259 urls
.populateMimeData(data
);
265 int KFileItemModel::indexForKeyboardSearch(const QString
& text
, int startFromIndex
) const
267 startFromIndex
= qMax(0, startFromIndex
);
268 for (int i
= startFromIndex
; i
< count(); ++i
) {
269 if (data(i
)["text"].toString().startsWith(text
, Qt::CaseInsensitive
)) {
273 for (int i
= 0; i
< startFromIndex
; ++i
) {
274 if (data(i
)["text"].toString().startsWith(text
, Qt::CaseInsensitive
)) {
281 bool KFileItemModel::supportsDropping(int index
) const
283 const KFileItem item
= fileItem(index
);
284 return !item
.isNull() && (item
.isDir() || item
.isDesktopFile());
287 QString
KFileItemModel::roleDescription(const QByteArray
& role
) const
289 static QHash
<QByteArray
, QString
> description
;
290 if (description
.isEmpty()) {
292 const RoleInfoMap
* map
= rolesInfoMap(count
);
293 for (int i
= 0; i
< count
; ++i
) {
294 description
.insert(map
[i
].role
, i18nc(map
[i
].roleTranslationContext
, map
[i
].roleTranslation
));
298 return description
.value(role
);
301 QList
<QPair
<int, QVariant
> > KFileItemModel::groups() const
303 if (!m_itemData
.isEmpty() && m_groups
.isEmpty()) {
304 #ifdef KFILEITEMMODEL_DEBUG
308 switch (typeForRole(sortRole())) {
309 case NameRole
: m_groups
= nameRoleGroups(); break;
310 case SizeRole
: m_groups
= sizeRoleGroups(); break;
311 case DateRole
: m_groups
= dateRoleGroups(); break;
312 case PermissionsRole
: m_groups
= permissionRoleGroups(); break;
313 case RatingRole
: m_groups
= ratingRoleGroups(); break;
314 default: m_groups
= genericStringRoleGroups(sortRole()); break;
317 #ifdef KFILEITEMMODEL_DEBUG
318 kDebug() << "[TIME] Calculating groups for" << count() << "items:" << timer
.elapsed();
325 KFileItem
KFileItemModel::fileItem(int index
) const
327 if (index
>= 0 && index
< count()) {
328 return m_itemData
.at(index
)->item
;
334 KFileItem
KFileItemModel::fileItem(const KUrl
& url
) const
336 const int index
= m_items
.value(url
, -1);
338 return m_itemData
.at(index
)->item
;
343 int KFileItemModel::index(const KFileItem
& item
) const
349 return m_items
.value(item
.url(), -1);
352 int KFileItemModel::index(const KUrl
& url
) const
354 KUrl urlToFind
= url
;
355 urlToFind
.adjustPath(KUrl::RemoveTrailingSlash
);
356 return m_items
.value(urlToFind
, -1);
359 KFileItem
KFileItemModel::rootItem() const
361 return m_dirLister
->rootItem();
364 void KFileItemModel::clear()
369 void KFileItemModel::setRoles(const QSet
<QByteArray
>& roles
)
371 if (m_roles
== roles
) {
377 const bool supportedExpanding
= m_requestRole
[ExpandedParentsCountRole
];
378 const bool willSupportExpanding
= roles
.contains("expandedParentsCount");
379 if (supportedExpanding
&& !willSupportExpanding
) {
380 // No expanding is supported anymore. Take care to delete all items that have an expansion level
381 // that is not 0 (and hence are part of an expanded item).
382 removeExpandedItems();
389 QSetIterator
<QByteArray
> it(roles
);
390 while (it
.hasNext()) {
391 const QByteArray
& role
= it
.next();
392 m_requestRole
[typeForRole(role
)] = true;
396 // Update m_data with the changed requested roles
397 const int maxIndex
= count() - 1;
398 for (int i
= 0; i
<= maxIndex
; ++i
) {
399 m_itemData
[i
]->values
= retrieveData(m_itemData
.at(i
)->item
);
402 kWarning() << "TODO: Emitting itemsChanged() with no information what has changed!";
403 emit
itemsChanged(KItemRangeList() << KItemRange(0, count()), QSet
<QByteArray
>());
407 QSet
<QByteArray
> KFileItemModel::roles() const
412 bool KFileItemModel::setExpanded(int index
, bool expanded
)
414 if (!isExpandable(index
) || isExpanded(index
) == expanded
) {
418 QHash
<QByteArray
, QVariant
> values
;
419 values
.insert("isExpanded", expanded
);
420 if (!setData(index
, values
)) {
424 const KUrl url
= m_itemData
.at(index
)->item
.url();
426 m_expandedDirs
.insert(url
);
427 m_dirLister
->openUrl(url
, KDirLister::Keep
);
429 m_expandedDirs
.remove(url
);
430 m_dirLister
->stop(url
);
433 KFileItemList itemsToRemove
;
434 const int expandedParentsCount
= data(index
)["expandedParentsCount"].toInt();
436 while (index
< count() && data(index
)["expandedParentsCount"].toInt() > expandedParentsCount
) {
437 itemsToRemove
.append(m_itemData
.at(index
)->item
);
440 removeItems(itemsToRemove
);
446 bool KFileItemModel::isExpanded(int index
) const
448 if (index
>= 0 && index
< count()) {
449 return m_itemData
.at(index
)->values
.value("isExpanded").toBool();
454 bool KFileItemModel::isExpandable(int index
) const
456 if (index
>= 0 && index
< count()) {
457 return m_itemData
.at(index
)->values
.value("isExpandable").toBool();
462 int KFileItemModel::expandedParentsCount(int index
) const
464 if (index
>= 0 && index
< count()) {
465 const int parentsCount
= m_itemData
.at(index
)->values
.value("expandedParentsCount").toInt();
466 if (parentsCount
> 0) {
473 QSet
<KUrl
> KFileItemModel::expandedDirectories() const
475 return m_expandedDirs
;
478 void KFileItemModel::restoreExpandedDirectories(const QSet
<KUrl
>& urls
)
480 m_urlsToExpand
= urls
;
483 void KFileItemModel::expandParentDirectories(const KUrl
& url
)
485 const int pos
= m_dirLister
->url().path().length();
487 // Assure that each sub-path of the URL that should be
488 // expanded is added to m_urlsToExpand. KDirLister
489 // does not care whether the parent-URL has already been
491 KUrl urlToExpand
= m_dirLister
->url();
492 const QStringList subDirs
= url
.path().mid(pos
).split(QDir::separator());
493 for (int i
= 0; i
< subDirs
.count() - 1; ++i
) {
494 urlToExpand
.addPath(subDirs
.at(i
));
495 m_urlsToExpand
.insert(urlToExpand
);
498 // KDirLister::open() must called at least once to trigger an initial
499 // loading. The pending URLs that must be restored are handled
500 // in slotCompleted().
501 QSetIterator
<KUrl
> it2(m_urlsToExpand
);
502 while (it2
.hasNext()) {
503 const int idx
= index(it2
.next());
504 if (idx
>= 0 && !isExpanded(idx
)) {
505 setExpanded(idx
, true);
511 void KFileItemModel::setNameFilter(const QString
& nameFilter
)
513 if (m_filter
.pattern() != nameFilter
) {
514 dispatchPendingItemsToInsert();
515 m_filter
.setPattern(nameFilter
);
520 QString
KFileItemModel::nameFilter() const
522 return m_filter
.pattern();
525 void KFileItemModel::setMimeTypeFilters(const QStringList
& filters
)
527 if (m_filter
.mimeTypes() != filters
) {
528 dispatchPendingItemsToInsert();
529 m_filter
.setMimeTypes(filters
);
534 QStringList
KFileItemModel::mimeTypeFilters() const
536 return m_filter
.mimeTypes();
540 void KFileItemModel::applyFilters()
542 // Check which shown items from m_itemData must get
543 // hidden and hence moved to m_filteredItems.
544 KFileItemList newFilteredItems
;
546 foreach (ItemData
* itemData
, m_itemData
) {
547 // Only filter non-expanded items as child items may never
548 // exist without a parent item
549 if (!itemData
->values
.value("isExpanded").toBool()) {
550 if (!m_filter
.matches(itemData
->item
)) {
551 newFilteredItems
.append(itemData
->item
);
552 m_filteredItems
.insert(itemData
->item
);
557 removeItems(newFilteredItems
);
559 // Check which hidden items from m_filteredItems should
560 // get visible again and hence removed from m_filteredItems.
561 KFileItemList newVisibleItems
;
563 QMutableSetIterator
<KFileItem
> it(m_filteredItems
);
564 while (it
.hasNext()) {
565 const KFileItem item
= it
.next();
566 if (m_filter
.matches(item
)) {
567 newVisibleItems
.append(item
);
572 insertItems(newVisibleItems
);
575 QList
<KFileItemModel::RoleInfo
> KFileItemModel::rolesInformation()
577 static QList
<RoleInfo
> rolesInfo
;
578 if (rolesInfo
.isEmpty()) {
580 const RoleInfoMap
* map
= rolesInfoMap(count
);
581 for (int i
= 0; i
< count
; ++i
) {
582 if (map
[i
].roleType
!= NoRole
) {
584 info
.role
= map
[i
].role
;
585 info
.translation
= i18nc(map
[i
].roleTranslationContext
, map
[i
].roleTranslation
);
586 if (map
[i
].groupTranslation
) {
587 info
.group
= i18nc(map
[i
].groupTranslationContext
, map
[i
].groupTranslation
);
589 // For top level roles, groupTranslation is 0. We must make sure that
590 // info.group is an empty string then because the code that generates
591 // menus tries to put the actions into sub menus otherwise.
592 info
.group
= QString();
594 info
.requiresNepomuk
= map
[i
].requiresNepomuk
;
595 info
.requiresIndexer
= map
[i
].requiresIndexer
;
596 rolesInfo
.append(info
);
604 void KFileItemModel::onGroupedSortingChanged(bool current
)
610 void KFileItemModel::onSortRoleChanged(const QByteArray
& current
, const QByteArray
& previous
)
613 m_sortRole
= typeForRole(current
);
615 #ifdef KFILEITEMMODEL_DEBUG
616 if (!m_requestRole
[m_sortRole
]) {
617 kWarning() << "The sort-role has been changed to a role that has not been received yet";
624 void KFileItemModel::onSortOrderChanged(Qt::SortOrder current
, Qt::SortOrder previous
)
631 void KFileItemModel::resortAllItems()
633 m_resortAllItemsTimer
->stop();
635 const int itemCount
= count();
636 if (itemCount
<= 0) {
640 #ifdef KFILEITEMMODEL_DEBUG
643 kDebug() << "===========================================================";
644 kDebug() << "Resorting" << itemCount
<< "items";
647 // Remember the order of the current URLs so
648 // that it can be determined which indexes have
649 // been moved because of the resorting.
651 oldUrls
.reserve(itemCount
);
652 foreach (const ItemData
* itemData
, m_itemData
) {
653 oldUrls
.append(itemData
->item
.url());
660 sort(m_itemData
.begin(), m_itemData
.end());
661 for (int i
= 0; i
< itemCount
; ++i
) {
662 m_items
.insert(m_itemData
.at(i
)->item
.url(), i
);
665 // Determine the indexes that have been moved
666 QList
<int> movedToIndexes
;
667 movedToIndexes
.reserve(itemCount
);
668 for (int i
= 0; i
< itemCount
; i
++) {
669 const int newIndex
= m_items
.value(oldUrls
.at(i
).url());
670 movedToIndexes
.append(newIndex
);
673 // Don't check whether items have really been moved and always emit a
674 // itemsMoved() signal after resorting: In case of grouped items
675 // the groups might change even if the items themselves don't change their
676 // position. Let the receiver of the signal decide whether a check for moved
677 // items makes sense.
678 emit
itemsMoved(KItemRange(0, itemCount
), movedToIndexes
);
680 #ifdef KFILEITEMMODEL_DEBUG
681 kDebug() << "[TIME] Resorting of" << itemCount
<< "items:" << timer
.elapsed();
685 void KFileItemModel::slotCompleted()
687 dispatchPendingItemsToInsert();
689 if (!m_urlsToExpand
.isEmpty()) {
690 // Try to find a URL that can be expanded.
691 // Note that the parent folder must be expanded before any of its subfolders become visible.
692 // Therefore, some URLs in m_restoredExpandedUrls might not be visible yet
693 // -> we expand the first visible URL we find in m_restoredExpandedUrls.
694 foreach (const KUrl
& url
, m_urlsToExpand
) {
695 const int index
= m_items
.value(url
, -1);
697 m_urlsToExpand
.remove(url
);
698 if (setExpanded(index
, true)) {
699 // The dir lister has been triggered. This slot will be called
700 // again after the directory has been expanded.
706 // None of the URLs in m_restoredExpandedUrls could be found in the model. This can happen
707 // if these URLs have been deleted in the meantime.
708 m_urlsToExpand
.clear();
711 emit
directoryLoadingCompleted();
714 void KFileItemModel::slotCanceled()
716 m_maximumUpdateIntervalTimer
->stop();
717 dispatchPendingItemsToInsert();
719 emit
directoryLoadingCanceled();
722 void KFileItemModel::slotNewItems(const KFileItemList
& items
)
724 Q_ASSERT(!items
.isEmpty());
726 if (m_requestRole
[ExpandedParentsCountRole
] && m_expandedParentsCountRoot
>= 0) {
727 // To be able to compare whether the new items may be inserted as children
728 // of a parent item the pending items must be added to the model first.
729 dispatchPendingItemsToInsert();
731 KFileItem item
= items
.first();
733 // If the expanding of items is enabled, the call
734 // dirLister->openUrl(url, KDirLister::Keep) in KFileItemModel::setExpanded()
735 // might result in emitting the same items twice due to the Keep-parameter.
736 // This case happens if an item gets expanded, collapsed and expanded again
737 // before the items could be loaded for the first expansion.
738 const int index
= m_items
.value(item
.url(), -1);
740 // The items are already part of the model.
744 // KDirLister keeps the children of items that got expanded once even if
745 // they got collapsed again with KFileItemModel::setExpanded(false). So it must be
746 // checked whether the parent for new items is still expanded.
747 KUrl parentUrl
= item
.url().upUrl();
748 parentUrl
.adjustPath(KUrl::RemoveTrailingSlash
);
749 const int parentIndex
= m_items
.value(parentUrl
, -1);
750 if (parentIndex
>= 0 && !m_itemData
[parentIndex
]->values
.value("isExpanded").toBool()) {
751 // The parent is not expanded.
756 if (!m_filter
.hasSetFilters()) {
757 m_pendingItemsToInsert
.append(items
);
759 // The name or type filter is active. Hide filtered items
760 // before inserting them into the model and remember
761 // the filtered items in m_filteredItems.
762 KFileItemList filteredItems
;
763 foreach (const KFileItem
& item
, items
) {
764 if (m_filter
.matches(item
)) {
765 filteredItems
.append(item
);
767 m_filteredItems
.insert(item
);
771 m_pendingItemsToInsert
.append(filteredItems
);
774 if (useMaximumUpdateInterval() && !m_maximumUpdateIntervalTimer
->isActive()) {
775 // Assure that items get dispatched if no completed() or canceled() signal is
776 // emitted during the maximum update interval.
777 m_maximumUpdateIntervalTimer
->start();
781 void KFileItemModel::slotItemsDeleted(const KFileItemList
& items
)
783 dispatchPendingItemsToInsert();
785 KFileItemList itemsToRemove
= items
;
786 if (m_requestRole
[ExpandedParentsCountRole
] && m_expandedParentsCountRoot
>= 0) {
787 // Assure that removing a parent item also results in removing all children
788 foreach (const KFileItem
& item
, items
) {
789 itemsToRemove
.append(childItems(item
));
793 if (!m_filteredItems
.isEmpty()) {
794 foreach (const KFileItem
& item
, itemsToRemove
) {
795 m_filteredItems
.remove(item
);
799 removeItems(itemsToRemove
);
802 void KFileItemModel::slotRefreshItems(const QList
<QPair
<KFileItem
, KFileItem
> >& items
)
804 Q_ASSERT(!items
.isEmpty());
805 #ifdef KFILEITEMMODEL_DEBUG
806 kDebug() << "Refreshing" << items
.count() << "items";
811 // Get the indexes of all items that have been refreshed
813 indexes
.reserve(items
.count());
815 QListIterator
<QPair
<KFileItem
, KFileItem
> > it(items
);
816 while (it
.hasNext()) {
817 const QPair
<KFileItem
, KFileItem
>& itemPair
= it
.next();
818 const KFileItem
& oldItem
= itemPair
.first
;
819 const KFileItem
& newItem
= itemPair
.second
;
820 const int index
= m_items
.value(oldItem
.url(), -1);
822 m_itemData
[index
]->item
= newItem
;
824 // Keep old values as long as possible if they could not retrieved synchronously yet.
825 // The update of the values will be done asynchronously by KFileItemModelRolesUpdater.
826 QHashIterator
<QByteArray
, QVariant
> it(retrieveData(newItem
));
827 while (it
.hasNext()) {
829 m_itemData
[index
]->values
.insert(it
.key(), it
.value());
832 m_items
.remove(oldItem
.url());
833 m_items
.insert(newItem
.url(), index
);
834 indexes
.append(index
);
838 // If the changed items have been created recently, they might not be in m_items yet.
839 // In that case, the list 'indexes' might be empty.
840 if (indexes
.isEmpty()) {
844 // Extract the item-ranges out of the changed indexes
847 KItemRangeList itemRangeList
;
848 int previousIndex
= indexes
.at(0);
849 int rangeIndex
= previousIndex
;
852 const int maxIndex
= indexes
.count() - 1;
853 for (int i
= 1; i
<= maxIndex
; ++i
) {
854 const int currentIndex
= indexes
.at(i
);
855 if (currentIndex
== previousIndex
+ 1) {
858 itemRangeList
.append(KItemRange(rangeIndex
, rangeCount
));
860 rangeIndex
= currentIndex
;
863 previousIndex
= currentIndex
;
866 if (rangeCount
> 0) {
867 itemRangeList
.append(KItemRange(rangeIndex
, rangeCount
));
870 emit
itemsChanged(itemRangeList
, m_roles
);
875 void KFileItemModel::slotClear()
877 #ifdef KFILEITEMMODEL_DEBUG
878 kDebug() << "Clearing all items";
881 m_filteredItems
.clear();
884 m_maximumUpdateIntervalTimer
->stop();
885 m_resortAllItemsTimer
->stop();
886 m_pendingItemsToInsert
.clear();
888 m_expandedParentsCountRoot
= UninitializedExpandedParentsCountRoot
;
890 const int removedCount
= m_itemData
.count();
891 if (removedCount
> 0) {
892 qDeleteAll(m_itemData
);
895 emit
itemsRemoved(KItemRangeList() << KItemRange(0, removedCount
));
898 m_expandedDirs
.clear();
901 void KFileItemModel::slotClear(const KUrl
& url
)
906 void KFileItemModel::slotNaturalSortingChanged()
908 m_naturalSorting
= KGlobalSettings::naturalSorting();
912 void KFileItemModel::dispatchPendingItemsToInsert()
914 if (!m_pendingItemsToInsert
.isEmpty()) {
915 insertItems(m_pendingItemsToInsert
);
916 m_pendingItemsToInsert
.clear();
920 void KFileItemModel::insertItems(const KFileItemList
& items
)
922 if (items
.isEmpty()) {
926 if (m_sortRole
== TypeRole
) {
927 // Try to resolve the MIME-types synchronously to prevent a reordering of
928 // the items when sorting by type (per default MIME-types are resolved
929 // asynchronously by KFileItemModelRolesUpdater).
930 determineMimeTypes(items
, 200);
933 #ifdef KFILEITEMMODEL_DEBUG
936 kDebug() << "===========================================================";
937 kDebug() << "Inserting" << items
.count() << "items";
942 QList
<ItemData
*> sortedItems
= createItemDataList(items
);
943 sort(sortedItems
.begin(), sortedItems
.end());
945 #ifdef KFILEITEMMODEL_DEBUG
946 kDebug() << "[TIME] Sorting:" << timer
.elapsed();
949 KItemRangeList itemRanges
;
952 int insertedAtIndex
= -1; // Index for the current item-range
953 int insertedCount
= 0; // Count for the current item-range
954 int previouslyInsertedCount
= 0; // Sum of previously inserted items for all ranges
955 while (sourceIndex
< sortedItems
.count()) {
956 // Find target index from m_items to insert the current item
958 const int previousTargetIndex
= targetIndex
;
959 while (targetIndex
< m_itemData
.count()) {
960 if (!lessThan(m_itemData
.at(targetIndex
), sortedItems
.at(sourceIndex
))) {
966 if (targetIndex
- previousTargetIndex
> 0 && insertedAtIndex
>= 0) {
967 itemRanges
<< KItemRange(insertedAtIndex
, insertedCount
);
968 previouslyInsertedCount
+= insertedCount
;
969 insertedAtIndex
= targetIndex
- previouslyInsertedCount
;
973 // Insert item at the position targetIndex by transferring
974 // the ownership of the item-data from sortedItems to m_itemData.
975 // m_items will be inserted after the loop (see comment below)
976 m_itemData
.insert(targetIndex
, sortedItems
.at(sourceIndex
));
979 if (insertedAtIndex
< 0) {
980 insertedAtIndex
= targetIndex
;
981 Q_ASSERT(previouslyInsertedCount
== 0);
987 // The indexes of all m_items must be adjusted, not only the index
989 const int itemDataCount
= m_itemData
.count();
990 for (int i
= 0; i
< itemDataCount
; ++i
) {
991 m_items
.insert(m_itemData
.at(i
)->item
.url(), i
);
994 itemRanges
<< KItemRange(insertedAtIndex
, insertedCount
);
995 emit
itemsInserted(itemRanges
);
997 #ifdef KFILEITEMMODEL_DEBUG
998 kDebug() << "[TIME] Inserting of" << items
.count() << "items:" << timer
.elapsed();
1002 static KItemRangeList
sortedIndexesToKItemRangeList(const QList
<int> sortedNumbers
)
1004 if (sortedNumbers
.empty()) {
1005 return KItemRangeList();
1008 KItemRangeList result
;
1010 QList
<int>::const_iterator it
= sortedNumbers
.begin();
1016 QList
<int>::const_iterator end
= sortedNumbers
.end();
1018 if (*it
== index
+ count
) {
1021 result
<< KItemRange(index
, count
);
1028 result
<< KItemRange(index
, count
);
1032 void KFileItemModel::removeItems(const KFileItemList
& items
)
1034 if (items
.isEmpty()) {
1038 #ifdef KFILEITEMMODEL_DEBUG
1039 kDebug() << "Removing " << items
.count() << "items";
1044 // Step 1: Determine the indexes of the removed items, remove them from
1045 // the hash m_items, and free the ItemData.
1046 QList
<int> indexesToRemove
;
1047 indexesToRemove
.reserve(items
.count());
1048 foreach (const KFileItem
& item
, items
) {
1049 const KUrl url
= item
.url();
1050 const int index
= m_items
.value(url
, -1);
1052 indexesToRemove
.append(index
);
1054 // Prevent repeated expensive rehashing by using QHash::erase(),
1055 // rather than QHash::remove().
1056 QHash
<KUrl
, int>::iterator it
= m_items
.find(url
);
1059 ItemData
* data
= m_itemData
.at(index
);
1061 m_itemData
[index
] = 0;
1063 kWarning() << "Item that should be deleted has not been found!";
1067 std::sort(indexesToRemove
.begin(), indexesToRemove
.end());
1069 // Step 2: Remove the ItemData pointers from the list m_itemData.
1070 const KItemRangeList itemRanges
= sortedIndexesToKItemRangeList(indexesToRemove
);
1071 int target
= itemRanges
.at(0).index
;
1072 int source
= itemRanges
.at(0).index
+ itemRanges
.at(0).count
;
1075 const int oldItemDataCount
= m_itemData
.count();
1076 while (source
< oldItemDataCount
) {
1077 if (nextRange
< itemRanges
.count() - 1 && source
== itemRanges
.at(nextRange
).index
) {
1078 // Skip the items in the next removed range.
1079 source
+= itemRanges
.at(nextRange
).count
;
1082 m_itemData
[target
] = m_itemData
[source
];
1087 m_itemData
.erase(m_itemData
.end() - indexesToRemove
.count(), m_itemData
.end());
1089 // Step 3: Adjust indexes in the hash m_items. Note that all indexes
1090 // might have been changed by the removal of the items.
1091 const int newItemDataCount
= m_itemData
.count();
1092 for (int i
= 0; i
< newItemDataCount
; ++i
) {
1093 m_items
.insert(m_itemData
.at(i
)->item
.url(), i
);
1097 m_expandedParentsCountRoot
= UninitializedExpandedParentsCountRoot
;
1100 emit
itemsRemoved(itemRanges
);
1103 QList
<KFileItemModel::ItemData
*> KFileItemModel::createItemDataList(const KFileItemList
& items
) const
1105 QList
<ItemData
*> itemDataList
;
1106 itemDataList
.reserve(items
.count());
1108 foreach (const KFileItem
& item
, items
) {
1109 ItemData
* itemData
= new ItemData();
1110 itemData
->item
= item
;
1111 itemData
->values
= retrieveData(item
);
1112 itemData
->parent
= 0;
1114 const bool determineParent
= m_requestRole
[ExpandedParentsCountRole
]
1115 && itemData
->values
["expandedParentsCount"].toInt() > 0;
1116 if (determineParent
) {
1117 KUrl parentUrl
= item
.url().upUrl();
1118 parentUrl
.adjustPath(KUrl::RemoveTrailingSlash
);
1119 const int parentIndex
= m_items
.value(parentUrl
, -1);
1120 if (parentIndex
>= 0) {
1121 itemData
->parent
= m_itemData
.at(parentIndex
);
1123 kWarning() << "Parent item not found for" << item
.url();
1127 itemDataList
.append(itemData
);
1130 return itemDataList
;
1133 void KFileItemModel::removeExpandedItems()
1135 KFileItemList expandedItems
;
1137 const int maxIndex
= m_itemData
.count() - 1;
1138 for (int i
= 0; i
<= maxIndex
; ++i
) {
1139 const ItemData
* itemData
= m_itemData
.at(i
);
1140 if (itemData
->values
.value("expandedParentsCount").toInt() > 0) {
1141 expandedItems
.append(itemData
->item
);
1145 // The m_expandedParentsCountRoot may not get reset before all items with
1146 // a bigger count have been removed.
1147 removeItems(expandedItems
);
1149 m_expandedParentsCountRoot
= UninitializedExpandedParentsCountRoot
;
1150 m_expandedDirs
.clear();
1153 void KFileItemModel::resetRoles()
1155 for (int i
= 0; i
< RolesCount
; ++i
) {
1156 m_requestRole
[i
] = false;
1160 KFileItemModel::RoleType
KFileItemModel::typeForRole(const QByteArray
& role
) const
1162 static QHash
<QByteArray
, RoleType
> roles
;
1163 if (roles
.isEmpty()) {
1164 // Insert user visible roles that can be accessed with
1165 // KFileItemModel::roleInformation()
1167 const RoleInfoMap
* map
= rolesInfoMap(count
);
1168 for (int i
= 0; i
< count
; ++i
) {
1169 roles
.insert(map
[i
].role
, map
[i
].roleType
);
1172 // Insert internal roles (take care to synchronize the implementation
1173 // with KFileItemModel::roleForType() in case if a change is done).
1174 roles
.insert("isDir", IsDirRole
);
1175 roles
.insert("isLink", IsLinkRole
);
1176 roles
.insert("isExpanded", IsExpandedRole
);
1177 roles
.insert("isExpandable", IsExpandableRole
);
1178 roles
.insert("expandedParentsCount", ExpandedParentsCountRole
);
1180 Q_ASSERT(roles
.count() == RolesCount
);
1183 return roles
.value(role
, NoRole
);
1186 QByteArray
KFileItemModel::roleForType(RoleType roleType
) const
1188 static QHash
<RoleType
, QByteArray
> roles
;
1189 if (roles
.isEmpty()) {
1190 // Insert user visible roles that can be accessed with
1191 // KFileItemModel::roleInformation()
1193 const RoleInfoMap
* map
= rolesInfoMap(count
);
1194 for (int i
= 0; i
< count
; ++i
) {
1195 roles
.insert(map
[i
].roleType
, map
[i
].role
);
1198 // Insert internal roles (take care to synchronize the implementation
1199 // with KFileItemModel::typeForRole() in case if a change is done).
1200 roles
.insert(IsDirRole
, "isDir");
1201 roles
.insert(IsLinkRole
, "isLink");
1202 roles
.insert(IsExpandedRole
, "isExpanded");
1203 roles
.insert(IsExpandableRole
, "isExpandable");
1204 roles
.insert(ExpandedParentsCountRole
, "expandedParentsCount");
1206 Q_ASSERT(roles
.count() == RolesCount
);
1209 return roles
.value(roleType
);
1212 QHash
<QByteArray
, QVariant
> KFileItemModel::retrieveData(const KFileItem
& item
) const
1214 // It is important to insert only roles that are fast to retrieve. E.g.
1215 // KFileItem::iconName() can be very expensive if the MIME-type is unknown
1216 // and hence will be retrieved asynchronously by KFileItemModelRolesUpdater.
1217 QHash
<QByteArray
, QVariant
> data
;
1218 data
.insert("url", item
.url());
1220 const bool isDir
= item
.isDir();
1221 if (m_requestRole
[IsDirRole
]) {
1222 data
.insert("isDir", isDir
);
1225 if (m_requestRole
[IsLinkRole
]) {
1226 const bool isLink
= item
.isLink();
1227 data
.insert("isLink", isLink
);
1230 if (m_requestRole
[NameRole
]) {
1231 data
.insert("text", item
.text());
1234 if (m_requestRole
[SizeRole
]) {
1236 data
.insert("size", QVariant());
1238 data
.insert("size", item
.size());
1242 if (m_requestRole
[DateRole
]) {
1243 // Don't use KFileItem::timeString() as this is too expensive when
1244 // having several thousands of items. Instead the formatting of the
1245 // date-time will be done on-demand by the view when the date will be shown.
1246 const KDateTime dateTime
= item
.time(KFileItem::ModificationTime
);
1247 data
.insert("date", dateTime
.dateTime());
1250 if (m_requestRole
[PermissionsRole
]) {
1251 data
.insert("permissions", item
.permissionsString());
1254 if (m_requestRole
[OwnerRole
]) {
1255 data
.insert("owner", item
.user());
1258 if (m_requestRole
[GroupRole
]) {
1259 data
.insert("group", item
.group());
1262 if (m_requestRole
[DestinationRole
]) {
1263 QString destination
= item
.linkDest();
1264 if (destination
.isEmpty()) {
1265 destination
= QLatin1String("-");
1267 data
.insert("destination", destination
);
1270 if (m_requestRole
[PathRole
]) {
1272 if (item
.url().protocol() == QLatin1String("trash")) {
1273 path
= item
.entry().stringValue(KIO::UDSEntry::UDS_EXTRA
);
1275 // For performance reasons cache the home-path in a static QString
1276 // (see QDir::homePath() for more details)
1277 static QString homePath
;
1278 if (homePath
.isEmpty()) {
1279 homePath
= QDir::homePath();
1282 path
= item
.localPath();
1283 if (path
.startsWith(homePath
)) {
1284 path
.replace(0, homePath
.length(), QLatin1Char('~'));
1288 const int index
= path
.lastIndexOf(item
.text());
1289 path
= path
.mid(0, index
- 1);
1290 data
.insert("path", path
);
1293 if (m_requestRole
[IsExpandedRole
]) {
1294 data
.insert("isExpanded", false);
1297 if (m_requestRole
[IsExpandableRole
]) {
1298 data
.insert("isExpandable", item
.isDir() && item
.url() == item
.targetUrl());
1301 if (m_requestRole
[ExpandedParentsCountRole
]) {
1302 if (m_expandedParentsCountRoot
== UninitializedExpandedParentsCountRoot
) {
1303 const KUrl rootUrl
= m_dirLister
->url();
1304 const QString protocol
= rootUrl
.protocol();
1305 const bool forceExpandedParentsCountRoot
= (protocol
== QLatin1String("trash") ||
1306 protocol
== QLatin1String("nepomuk") ||
1307 protocol
== QLatin1String("remote") ||
1308 protocol
.contains(QLatin1String("search")));
1309 if (forceExpandedParentsCountRoot
) {
1310 m_expandedParentsCountRoot
= ForceExpandedParentsCountRoot
;
1312 const QString rootDir
= rootUrl
.path(KUrl::AddTrailingSlash
);
1313 m_expandedParentsCountRoot
= rootDir
.count('/');
1317 if (m_expandedParentsCountRoot
== ForceExpandedParentsCountRoot
) {
1318 data
.insert("expandedParentsCount", -1);
1320 const QString dir
= item
.url().directory(KUrl::AppendTrailingSlash
);
1321 const int level
= dir
.count('/') - m_expandedParentsCountRoot
;
1322 data
.insert("expandedParentsCount", level
);
1326 if (item
.isMimeTypeKnown()) {
1327 data
.insert("iconName", item
.iconName());
1329 if (m_requestRole
[TypeRole
]) {
1330 data
.insert("type", item
.mimeComment());
1337 bool KFileItemModel::lessThan(const ItemData
* a
, const ItemData
* b
) const
1341 if (m_expandedParentsCountRoot
>= 0) {
1342 result
= expandedParentsCountCompare(a
, b
);
1344 // The items have parents with different expansion levels
1345 return (sortOrder() == Qt::AscendingOrder
) ? result
< 0 : result
> 0;
1349 if (m_sortDirsFirst
|| m_sortRole
== SizeRole
) {
1350 const bool isDirA
= a
->item
.isDir();
1351 const bool isDirB
= b
->item
.isDir();
1352 if (isDirA
&& !isDirB
) {
1354 } else if (!isDirA
&& isDirB
) {
1359 result
= sortRoleCompare(a
, b
);
1361 return (sortOrder() == Qt::AscendingOrder
) ? result
< 0 : result
> 0;
1365 * Helper class for KFileItemModel::sort().
1367 class KFileItemModelLessThan
1370 KFileItemModelLessThan(const KFileItemModel
* model
) :
1375 bool operator()(const KFileItemModel::ItemData
* a
, const KFileItemModel::ItemData
* b
) const
1377 return m_model
->lessThan(a
, b
);
1381 const KFileItemModel
* m_model
;
1384 void KFileItemModel::sort(QList
<KFileItemModel::ItemData
*>::iterator begin
,
1385 QList
<KFileItemModel::ItemData
*>::iterator end
) const
1387 KFileItemModelLessThan
lessThan(this);
1389 if (m_sortRole
== NameRole
) {
1390 // Sorting by name can be expensive, in particular if natural sorting is
1391 // enabled. Use all CPU cores to speed up the sorting process.
1392 static const int numberOfThreads
= QThread::idealThreadCount();
1393 parallelMergeSort(begin
, end
, lessThan
, numberOfThreads
);
1395 // Sorting by other roles is quite fast. Use only one thread to prevent
1396 // problems caused by non-reentrant comparison functions, see
1397 // https://bugs.kde.org/show_bug.cgi?id=312679
1398 mergeSort(begin
, end
, lessThan
);
1402 int KFileItemModel::sortRoleCompare(const ItemData
* a
, const ItemData
* b
) const
1404 const KFileItem
& itemA
= a
->item
;
1405 const KFileItem
& itemB
= b
->item
;
1409 switch (m_sortRole
) {
1411 // The name role is handled as default fallback after the switch
1415 if (itemA
.isDir()) {
1416 // See "if (m_sortFoldersFirst || m_sortRole == SizeRole)" in KFileItemModel::lessThan():
1417 Q_ASSERT(itemB
.isDir());
1419 const QVariant valueA
= a
->values
.value("size");
1420 const QVariant valueB
= b
->values
.value("size");
1421 if (valueA
.isNull() && valueB
.isNull()) {
1423 } else if (valueA
.isNull()) {
1425 } else if (valueB
.isNull()) {
1428 result
= valueA
.toInt() - valueB
.toInt();
1431 // See "if (m_sortFoldersFirst || m_sortRole == SizeRole)" in KFileItemModel::lessThan():
1432 Q_ASSERT(!itemB
.isDir());
1433 const KIO::filesize_t sizeA
= itemA
.size();
1434 const KIO::filesize_t sizeB
= itemB
.size();
1435 if (sizeA
> sizeB
) {
1437 } else if (sizeA
< sizeB
) {
1447 const KDateTime dateTimeA
= itemA
.time(KFileItem::ModificationTime
);
1448 const KDateTime dateTimeB
= itemB
.time(KFileItem::ModificationTime
);
1449 if (dateTimeA
< dateTimeB
) {
1451 } else if (dateTimeA
> dateTimeB
) {
1458 result
= a
->values
.value("rating").toInt() - b
->values
.value("rating").toInt();
1462 case ImageSizeRole
: {
1463 // Alway use a natural comparing to interpret the numbers of a string like
1464 // "1600 x 1200" for having a correct sorting.
1465 result
= KStringHandler::naturalCompare(a
->values
.value("imageSize").toString(),
1466 b
->values
.value("imageSize").toString(),
1472 const QByteArray role
= roleForType(m_sortRole
);
1473 result
= QString::compare(a
->values
.value(role
).toString(),
1474 b
->values
.value(role
).toString());
1481 // The current sort role was sufficient to define an order
1485 // Fallback #1: Compare the text of the items
1486 result
= stringCompare(itemA
.text(), itemB
.text());
1491 // Fallback #2: KFileItem::text() may not be unique in case UDS_DISPLAY_NAME is used
1492 result
= stringCompare(itemA
.name(m_caseSensitivity
== Qt::CaseInsensitive
),
1493 itemB
.name(m_caseSensitivity
== Qt::CaseInsensitive
));
1498 // Fallback #3: It must be assured that the sort order is always unique even if two values have been
1499 // equal. In this case a comparison of the URL is done which is unique in all cases
1500 // within KDirLister.
1501 return QString::compare(itemA
.url().url(), itemB
.url().url(), Qt::CaseSensitive
);
1504 int KFileItemModel::stringCompare(const QString
& a
, const QString
& b
) const
1506 // Taken from KDirSortFilterProxyModel (kdelibs/kfile/kdirsortfilterproxymodel.*)
1507 // Copyright (C) 2006 by Peter Penz <peter.penz@gmx.at>
1508 // Copyright (C) 2006 by Dominic Battre <dominic@battre.de>
1509 // Copyright (C) 2006 by Martin Pool <mbp@canonical.com>
1511 if (m_caseSensitivity
== Qt::CaseInsensitive
) {
1512 const int result
= m_naturalSorting
? KStringHandler::naturalCompare(a
, b
, Qt::CaseInsensitive
)
1513 : QString::compare(a
, b
, Qt::CaseInsensitive
);
1515 // Only return the result, if the strings are not equal. If they are equal by a case insensitive
1516 // comparison, still a deterministic sort order is required. A case sensitive
1517 // comparison is done as fallback.
1522 return m_naturalSorting
? KStringHandler::naturalCompare(a
, b
, Qt::CaseSensitive
)
1523 : QString::compare(a
, b
, Qt::CaseSensitive
);
1526 int KFileItemModel::expandedParentsCountCompare(const ItemData
* a
, const ItemData
* b
) const
1528 const KUrl urlA
= a
->item
.url();
1529 const KUrl urlB
= b
->item
.url();
1530 if (urlA
.directory() == urlB
.directory()) {
1531 // Both items have the same directory as parent
1535 // Check whether one item is the parent of the other item
1536 if (urlA
.isParentOf(urlB
)) {
1537 return (sortOrder() == Qt::AscendingOrder
) ? -1 : +1;
1538 } else if (urlB
.isParentOf(urlA
)) {
1539 return (sortOrder() == Qt::AscendingOrder
) ? +1 : -1;
1542 // Determine the maximum common path of both items and
1543 // remember the index in 'index'
1544 const QString pathA
= urlA
.path();
1545 const QString pathB
= urlB
.path();
1547 const int maxIndex
= qMin(pathA
.length(), pathB
.length()) - 1;
1549 while (index
<= maxIndex
&& pathA
.at(index
) == pathB
.at(index
)) {
1552 if (index
> maxIndex
) {
1555 while (index
> 0 && (pathA
.at(index
) != QLatin1Char('/') || pathB
.at(index
) != QLatin1Char('/'))) {
1559 // Determine the first sub-path after the common path and
1560 // check whether it represents a directory or already a file
1562 const QString subPathA
= subPath(a
->item
, pathA
, index
, &isDirA
);
1564 const QString subPathB
= subPath(b
->item
, pathB
, index
, &isDirB
);
1566 if (m_sortDirsFirst
|| m_sortRole
== SizeRole
) {
1567 if (isDirA
&& !isDirB
) {
1568 return (sortOrder() == Qt::AscendingOrder
) ? -1 : +1;
1569 } else if (!isDirA
&& isDirB
) {
1570 return (sortOrder() == Qt::AscendingOrder
) ? +1 : -1;
1574 // Compare the items of the parents that represent the first
1575 // different path after the common path.
1576 const QString parentPathA
= pathA
.left(index
) + subPathA
;
1577 const QString parentPathB
= pathB
.left(index
) + subPathB
;
1579 const ItemData
* parentA
= a
;
1580 while (parentA
&& parentA
->item
.url().path() != parentPathA
) {
1581 parentA
= parentA
->parent
;
1584 const ItemData
* parentB
= b
;
1585 while (parentB
&& parentB
->item
.url().path() != parentPathB
) {
1586 parentB
= parentB
->parent
;
1589 if (parentA
&& parentB
) {
1590 return sortRoleCompare(parentA
, parentB
);
1593 kWarning() << "Child items without parent detected:" << a
->item
.url() << b
->item
.url();
1594 return QString::compare(urlA
.url(), urlB
.url(), Qt::CaseSensitive
);
1597 QString
KFileItemModel::subPath(const KFileItem
& item
,
1598 const QString
& itemPath
,
1603 const int pathIndex
= itemPath
.indexOf('/', start
+ 1);
1604 *isDir
= (pathIndex
> 0) || item
.isDir();
1605 return itemPath
.mid(start
, pathIndex
- start
);
1608 bool KFileItemModel::useMaximumUpdateInterval() const
1610 return !m_dirLister
->url().isLocalFile();
1613 QList
<QPair
<int, QVariant
> > KFileItemModel::nameRoleGroups() const
1615 Q_ASSERT(!m_itemData
.isEmpty());
1617 const int maxIndex
= count() - 1;
1618 QList
<QPair
<int, QVariant
> > groups
;
1622 bool isLetter
= false;
1623 for (int i
= 0; i
<= maxIndex
; ++i
) {
1624 if (isChildItem(i
)) {
1628 const QString name
= m_itemData
.at(i
)->values
.value("text").toString();
1630 // Use the first character of the name as group indication
1631 QChar newFirstChar
= name
.at(0).toUpper();
1632 if (newFirstChar
== QLatin1Char('~') && name
.length() > 1) {
1633 newFirstChar
= name
.at(1).toUpper();
1636 if (firstChar
!= newFirstChar
) {
1637 QString newGroupValue
;
1638 if (newFirstChar
>= QLatin1Char('A') && newFirstChar
<= QLatin1Char('Z')) {
1639 // Apply group 'A' - 'Z'
1640 newGroupValue
= newFirstChar
;
1642 } else if (newFirstChar
>= QLatin1Char('0') && newFirstChar
<= QLatin1Char('9')) {
1643 // Apply group '0 - 9' for any name that starts with a digit
1644 newGroupValue
= i18nc("@title:group Groups that start with a digit", "0 - 9");
1648 // If the current group is 'A' - 'Z' check whether a locale character
1649 // fits into the existing group.
1650 // TODO: This does not work in the case if e.g. the group 'O' starts with
1651 // an umlaut 'O' -> provide unit-test to document this known issue
1652 const QChar
prevChar(firstChar
.unicode() - ushort(1));
1653 const QChar
nextChar(firstChar
.unicode() + ushort(1));
1654 const QString
currChar(newFirstChar
);
1655 const bool partOfCurrentGroup
= currChar
.localeAwareCompare(prevChar
) > 0 &&
1656 currChar
.localeAwareCompare(nextChar
) < 0;
1657 if (partOfCurrentGroup
) {
1661 newGroupValue
= i18nc("@title:group", "Others");
1665 if (newGroupValue
!= groupValue
) {
1666 groupValue
= newGroupValue
;
1667 groups
.append(QPair
<int, QVariant
>(i
, newGroupValue
));
1670 firstChar
= newFirstChar
;
1676 QList
<QPair
<int, QVariant
> > KFileItemModel::sizeRoleGroups() const
1678 Q_ASSERT(!m_itemData
.isEmpty());
1680 const int maxIndex
= count() - 1;
1681 QList
<QPair
<int, QVariant
> > groups
;
1684 for (int i
= 0; i
<= maxIndex
; ++i
) {
1685 if (isChildItem(i
)) {
1689 const KFileItem
& item
= m_itemData
.at(i
)->item
;
1690 const KIO::filesize_t fileSize
= !item
.isNull() ? item
.size() : ~0U;
1691 QString newGroupValue
;
1692 if (!item
.isNull() && item
.isDir()) {
1693 newGroupValue
= i18nc("@title:group Size", "Folders");
1694 } else if (fileSize
< 5 * 1024 * 1024) {
1695 newGroupValue
= i18nc("@title:group Size", "Small");
1696 } else if (fileSize
< 10 * 1024 * 1024) {
1697 newGroupValue
= i18nc("@title:group Size", "Medium");
1699 newGroupValue
= i18nc("@title:group Size", "Big");
1702 if (newGroupValue
!= groupValue
) {
1703 groupValue
= newGroupValue
;
1704 groups
.append(QPair
<int, QVariant
>(i
, newGroupValue
));
1711 QList
<QPair
<int, QVariant
> > KFileItemModel::dateRoleGroups() const
1713 Q_ASSERT(!m_itemData
.isEmpty());
1715 const int maxIndex
= count() - 1;
1716 QList
<QPair
<int, QVariant
> > groups
;
1718 const QDate currentDate
= KDateTime::currentLocalDateTime().date();
1720 int yearForCurrentWeek
= 0;
1721 int currentWeek
= currentDate
.weekNumber(&yearForCurrentWeek
);
1722 if (yearForCurrentWeek
== currentDate
.year() + 1) {
1726 QDate previousModifiedDate
;
1728 for (int i
= 0; i
<= maxIndex
; ++i
) {
1729 if (isChildItem(i
)) {
1733 const KDateTime modifiedTime
= m_itemData
.at(i
)->item
.time(KFileItem::ModificationTime
);
1734 const QDate modifiedDate
= modifiedTime
.date();
1735 if (modifiedDate
== previousModifiedDate
) {
1736 // The current item is in the same group as the previous item
1739 previousModifiedDate
= modifiedDate
;
1741 const int daysDistance
= modifiedDate
.daysTo(currentDate
);
1743 int yearForModifiedWeek
= 0;
1744 int modifiedWeek
= modifiedDate
.weekNumber(&yearForModifiedWeek
);
1745 if (yearForModifiedWeek
== modifiedDate
.year() + 1) {
1749 QString newGroupValue
;
1750 if (currentDate
.year() == modifiedDate
.year() && currentDate
.month() == modifiedDate
.month()) {
1751 if (modifiedWeek
> currentWeek
) {
1752 // Usecase: modified date = 2010-01-01, current date = 2010-01-22
1753 // modified week = 53, current week = 3
1756 switch (currentWeek
- modifiedWeek
) {
1758 switch (daysDistance
) {
1759 case 0: newGroupValue
= i18nc("@title:group Date", "Today"); break;
1760 case 1: newGroupValue
= i18nc("@title:group Date", "Yesterday"); break;
1761 default: newGroupValue
= modifiedTime
.toString(i18nc("@title:group The week day name: %A", "%A"));
1765 newGroupValue
= i18nc("@title:group Date", "Last Week");
1768 newGroupValue
= i18nc("@title:group Date", "Two Weeks Ago");
1771 newGroupValue
= i18nc("@title:group Date", "Three Weeks Ago");
1775 newGroupValue
= i18nc("@title:group Date", "Earlier this Month");
1781 const QDate lastMonthDate
= currentDate
.addMonths(-1);
1782 if (lastMonthDate
.year() == modifiedDate
.year() && lastMonthDate
.month() == modifiedDate
.month()) {
1783 if (daysDistance
== 1) {
1784 newGroupValue
= modifiedTime
.toString(i18nc("@title:group Date: %B is full month name in current locale, and %Y is full year number", "Yesterday (%B, %Y)"));
1785 } else if (daysDistance
<= 7) {
1786 newGroupValue
= modifiedTime
.toString(i18nc("@title:group The week day name: %A, %B is full month name in current locale, and %Y is full year number", "%A (%B, %Y)"));
1787 } else if (daysDistance
<= 7 * 2) {
1788 newGroupValue
= modifiedTime
.toString(i18nc("@title:group Date: %B is full month name in current locale, and %Y is full year number", "Last Week (%B, %Y)"));
1789 } else if (daysDistance
<= 7 * 3) {
1790 newGroupValue
= modifiedTime
.toString(i18nc("@title:group Date: %B is full month name in current locale, and %Y is full year number", "Two Weeks Ago (%B, %Y)"));
1791 } else if (daysDistance
<= 7 * 4) {
1792 newGroupValue
= modifiedTime
.toString(i18nc("@title:group Date: %B is full month name in current locale, and %Y is full year number", "Three Weeks Ago (%B, %Y)"));
1794 newGroupValue
= modifiedTime
.toString(i18nc("@title:group Date: %B is full month name in current locale, and %Y is full year number", "Earlier on %B, %Y"));
1797 newGroupValue
= modifiedTime
.toString(i18nc("@title:group The month and year: %B is full month name in current locale, and %Y is full year number", "%B, %Y"));
1801 if (newGroupValue
!= groupValue
) {
1802 groupValue
= newGroupValue
;
1803 groups
.append(QPair
<int, QVariant
>(i
, newGroupValue
));
1810 QList
<QPair
<int, QVariant
> > KFileItemModel::permissionRoleGroups() const
1812 Q_ASSERT(!m_itemData
.isEmpty());
1814 const int maxIndex
= count() - 1;
1815 QList
<QPair
<int, QVariant
> > groups
;
1817 QString permissionsString
;
1819 for (int i
= 0; i
<= maxIndex
; ++i
) {
1820 if (isChildItem(i
)) {
1824 const ItemData
* itemData
= m_itemData
.at(i
);
1825 const QString newPermissionsString
= itemData
->values
.value("permissions").toString();
1826 if (newPermissionsString
== permissionsString
) {
1829 permissionsString
= newPermissionsString
;
1831 const QFileInfo
info(itemData
->item
.url().pathOrUrl());
1835 if (info
.permission(QFile::ReadUser
)) {
1836 user
= i18nc("@item:intext Access permission, concatenated", "Read, ");
1838 if (info
.permission(QFile::WriteUser
)) {
1839 user
+= i18nc("@item:intext Access permission, concatenated", "Write, ");
1841 if (info
.permission(QFile::ExeUser
)) {
1842 user
+= i18nc("@item:intext Access permission, concatenated", "Execute, ");
1844 user
= user
.isEmpty() ? i18nc("@item:intext Access permission, concatenated", "Forbidden") : user
.mid(0, user
.count() - 2);
1848 if (info
.permission(QFile::ReadGroup
)) {
1849 group
= i18nc("@item:intext Access permission, concatenated", "Read, ");
1851 if (info
.permission(QFile::WriteGroup
)) {
1852 group
+= i18nc("@item:intext Access permission, concatenated", "Write, ");
1854 if (info
.permission(QFile::ExeGroup
)) {
1855 group
+= i18nc("@item:intext Access permission, concatenated", "Execute, ");
1857 group
= group
.isEmpty() ? i18nc("@item:intext Access permission, concatenated", "Forbidden") : group
.mid(0, group
.count() - 2);
1859 // Set others string
1861 if (info
.permission(QFile::ReadOther
)) {
1862 others
= i18nc("@item:intext Access permission, concatenated", "Read, ");
1864 if (info
.permission(QFile::WriteOther
)) {
1865 others
+= i18nc("@item:intext Access permission, concatenated", "Write, ");
1867 if (info
.permission(QFile::ExeOther
)) {
1868 others
+= i18nc("@item:intext Access permission, concatenated", "Execute, ");
1870 others
= others
.isEmpty() ? i18nc("@item:intext Access permission, concatenated", "Forbidden") : others
.mid(0, others
.count() - 2);
1872 const QString newGroupValue
= i18nc("@title:group Files and folders by permissions", "User: %1 | Group: %2 | Others: %3", user
, group
, others
);
1873 if (newGroupValue
!= groupValue
) {
1874 groupValue
= newGroupValue
;
1875 groups
.append(QPair
<int, QVariant
>(i
, newGroupValue
));
1882 QList
<QPair
<int, QVariant
> > KFileItemModel::ratingRoleGroups() const
1884 Q_ASSERT(!m_itemData
.isEmpty());
1886 const int maxIndex
= count() - 1;
1887 QList
<QPair
<int, QVariant
> > groups
;
1889 int groupValue
= -1;
1890 for (int i
= 0; i
<= maxIndex
; ++i
) {
1891 if (isChildItem(i
)) {
1894 const int newGroupValue
= m_itemData
.at(i
)->values
.value("rating", 0).toInt();
1895 if (newGroupValue
!= groupValue
) {
1896 groupValue
= newGroupValue
;
1897 groups
.append(QPair
<int, QVariant
>(i
, newGroupValue
));
1904 QList
<QPair
<int, QVariant
> > KFileItemModel::genericStringRoleGroups(const QByteArray
& role
) const
1906 Q_ASSERT(!m_itemData
.isEmpty());
1908 const int maxIndex
= count() - 1;
1909 QList
<QPair
<int, QVariant
> > groups
;
1911 bool isFirstGroupValue
= true;
1913 for (int i
= 0; i
<= maxIndex
; ++i
) {
1914 if (isChildItem(i
)) {
1917 const QString newGroupValue
= m_itemData
.at(i
)->values
.value(role
).toString();
1918 if (newGroupValue
!= groupValue
|| isFirstGroupValue
) {
1919 groupValue
= newGroupValue
;
1920 groups
.append(QPair
<int, QVariant
>(i
, newGroupValue
));
1921 isFirstGroupValue
= false;
1928 KFileItemList
KFileItemModel::childItems(const KFileItem
& item
) const
1930 KFileItemList items
;
1932 int index
= m_items
.value(item
.url(), -1);
1934 const int parentLevel
= m_itemData
.at(index
)->values
.value("expandedParentsCount").toInt();
1936 while (index
< m_itemData
.count() && m_itemData
.at(index
)->values
.value("expandedParentsCount").toInt() > parentLevel
) {
1937 items
.append(m_itemData
.at(index
)->item
);
1945 void KFileItemModel::emitSortProgress(int resolvedCount
)
1947 // Be tolerant against a resolvedCount with a wrong range.
1948 // Although there should not be a case where KFileItemModelRolesUpdater
1949 // (= caller) provides a wrong range, it is important to emit
1950 // a useful progress information even if there is an unexpected
1951 // implementation issue.
1953 const int itemCount
= count();
1954 if (resolvedCount
>= itemCount
) {
1955 m_sortingProgressPercent
= -1;
1956 if (m_resortAllItemsTimer
->isActive()) {
1957 m_resortAllItemsTimer
->stop();
1961 emit
directorySortingProgress(100);
1962 } else if (itemCount
> 0) {
1963 resolvedCount
= qBound(0, resolvedCount
, itemCount
);
1965 const int progress
= resolvedCount
* 100 / itemCount
;
1966 if (m_sortingProgressPercent
!= progress
) {
1967 m_sortingProgressPercent
= progress
;
1968 emit
directorySortingProgress(progress
);
1973 const KFileItemModel::RoleInfoMap
* KFileItemModel::rolesInfoMap(int& count
)
1975 static const RoleInfoMap rolesInfoMap
[] = {
1976 // | role | roleType | role translation | group translation | requires Nepomuk | requires indexer
1977 { 0, NoRole
, 0, 0, 0, 0, false, false },
1978 { "text", NameRole
, I18N_NOOP2_NOSTRIP("@label", "Name"), 0, 0, false, false },
1979 { "size", SizeRole
, I18N_NOOP2_NOSTRIP("@label", "Size"), 0, 0, false, false },
1980 { "date", DateRole
, I18N_NOOP2_NOSTRIP("@label", "Date"), 0, 0, false, false },
1981 { "type", TypeRole
, I18N_NOOP2_NOSTRIP("@label", "Type"), 0, 0, false, false },
1982 { "rating", RatingRole
, I18N_NOOP2_NOSTRIP("@label", "Rating"), 0, 0, true, false },
1983 { "tags", TagsRole
, I18N_NOOP2_NOSTRIP("@label", "Tags"), 0, 0, true, false },
1984 { "comment", CommentRole
, I18N_NOOP2_NOSTRIP("@label", "Comment"), 0, 0, true, false },
1985 { "wordCount", WordCountRole
, I18N_NOOP2_NOSTRIP("@label", "Word Count"), I18N_NOOP2_NOSTRIP("@label", "Document"), true, true },
1986 { "lineCount", LineCountRole
, I18N_NOOP2_NOSTRIP("@label", "Line Count"), I18N_NOOP2_NOSTRIP("@label", "Document"), true, true },
1987 { "imageSize", ImageSizeRole
, I18N_NOOP2_NOSTRIP("@label", "Image Size"), I18N_NOOP2_NOSTRIP("@label", "Image"), true, true },
1988 { "orientation", OrientationRole
, I18N_NOOP2_NOSTRIP("@label", "Orientation"), I18N_NOOP2_NOSTRIP("@label", "Image"), true, true },
1989 { "artist", ArtistRole
, I18N_NOOP2_NOSTRIP("@label", "Artist"), I18N_NOOP2_NOSTRIP("@label", "Audio"), true, true },
1990 { "album", AlbumRole
, I18N_NOOP2_NOSTRIP("@label", "Album"), I18N_NOOP2_NOSTRIP("@label", "Audio"), true, true },
1991 { "duration", DurationRole
, I18N_NOOP2_NOSTRIP("@label", "Duration"), I18N_NOOP2_NOSTRIP("@label", "Audio"), true, true },
1992 { "track", TrackRole
, I18N_NOOP2_NOSTRIP("@label", "Track"), I18N_NOOP2_NOSTRIP("@label", "Audio"), true, true },
1993 { "path", PathRole
, I18N_NOOP2_NOSTRIP("@label", "Path"), I18N_NOOP2_NOSTRIP("@label", "Other"), false, false },
1994 { "destination", DestinationRole
, I18N_NOOP2_NOSTRIP("@label", "Link Destination"), I18N_NOOP2_NOSTRIP("@label", "Other"), false, false },
1995 { "copiedFrom", CopiedFromRole
, I18N_NOOP2_NOSTRIP("@label", "Copied From"), I18N_NOOP2_NOSTRIP("@label", "Other"), true, false },
1996 { "permissions", PermissionsRole
, I18N_NOOP2_NOSTRIP("@label", "Permissions"), I18N_NOOP2_NOSTRIP("@label", "Other"), false, false },
1997 { "owner", OwnerRole
, I18N_NOOP2_NOSTRIP("@label", "Owner"), I18N_NOOP2_NOSTRIP("@label", "Other"), false, false },
1998 { "group", GroupRole
, I18N_NOOP2_NOSTRIP("@label", "User Group"), I18N_NOOP2_NOSTRIP("@label", "Other"), false, false },
2001 count
= sizeof(rolesInfoMap
) / sizeof(RoleInfoMap
);
2002 return rolesInfoMap
;
2005 void KFileItemModel::determineMimeTypes(const KFileItemList
& items
, int timeout
)
2007 QElapsedTimer timer
;
2009 foreach (KFileItem item
, items
) { // krazy:exclude=foreach
2010 item
.determineMimeType();
2011 if (timer
.elapsed() > timeout
) {
2012 // Don't block the user interface, let the remaining items
2013 // be resolved asynchronously.
2019 bool KFileItemModel::isConsistent() const
2021 // Check that m_items and m_itemData are consistent, and that the items are sorted.
2022 if (m_items
.count() != m_itemData
.count()) {
2026 for (int i
= 0; i
< count(); ++i
) {
2027 const KFileItem item
= fileItem(i
);
2028 if (item
.isNull()) {
2029 qWarning() << "Item" << i
<< "is null";
2033 const int itemIndex
= index(item
);
2034 if (itemIndex
!= i
) {
2035 qWarning() << "Item" << i
<< "has a wrong index:" << itemIndex
;
2039 if (i
> 0 && !lessThan(m_itemData
.at(i
- 1), m_itemData
.at(i
))) {
2040 qWarning() << "The order of items" << i
- 1 << "and" << i
<< "is wrong:"
2041 << fileItem(i
- 1) << fileItem(i
);
2049 #include "kfileitemmodel.moc"