src/kitemviews/kfileitemmodel.cpp

   1 /***************************************************************************
   2  *   Copyright (C) 2011 by Peter Penz <peter.penz19@gmail.com>             *
   3  *                                                                         *
   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.                                   *
   8  *                                                                         *
   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.                          *
  13  *                                                                         *
  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  ***************************************************************************/
  19
  20 #include "kfileitemmodel.h"
  21
  22 #include <KDirLister>
  23 #include <KDirModel>
  24 #include <KLocale>
  25 #include <KStringHandler>
  26 #include <KDebug>
  27
  28 #include <QMimeData>
  29 #include <QTimer>
  30
  31 #define KFILEITEMMODEL_DEBUG
  32
  33 KFileItemModel::KFileItemModel(KDirLister* dirLister, QObject* parent) :
  34     KItemModelBase("name", parent),
  35     m_dirLister(dirLister),
  36     m_naturalSorting(true),
  37     m_sortFoldersFirst(true),
  38     m_sortRole(NameRole),
  39     m_roles(),
  40     m_caseSensitivity(Qt::CaseInsensitive),
  41     m_itemData(),
  42     m_items(),
  43     m_filter(),
  44     m_filteredItems(),
  45     m_requestRole(),
  46     m_minimumUpdateIntervalTimer(0),
  47     m_maximumUpdateIntervalTimer(0),
  48     m_resortAllItemsTimer(0),
  49     m_pendingItemsToInsert(),
  50     m_pendingEmitLoadingCompleted(false),
  51     m_groups(),
  52     m_rootExpansionLevel(UninitializedRootExpansionLevel),
  53     m_expandedUrls(),
  54     m_urlsToExpand()
  55 {
  56     // Apply default roles that should be determined
  57     resetRoles();
  58     m_requestRole[NameRole] = true;
  59     m_requestRole[IsDirRole] = true;
  60     m_roles.insert("name");
  61     m_roles.insert("isDir");
  62
  63     Q_ASSERT(dirLister);
  64
  65     connect(dirLister, SIGNAL(canceled()), this, SLOT(slotCanceled()));
  66     connect(dirLister, SIGNAL(completed()), this, SLOT(slotCompleted()));
  67     connect(dirLister, SIGNAL(newItems(KFileItemList)), this, SLOT(slotNewItems(KFileItemList)));
  68     connect(dirLister, SIGNAL(itemsDeleted(KFileItemList)), this, SLOT(slotItemsDeleted(KFileItemList)));
  69     connect(dirLister, SIGNAL(refreshItems(QList<QPair<KFileItem,KFileItem> >)), this, SLOT(slotRefreshItems(QList<QPair<KFileItem,KFileItem> >)));
  70     connect(dirLister, SIGNAL(clear()), this, SLOT(slotClear()));
  71     connect(dirLister, SIGNAL(clear(KUrl)), this, SLOT(slotClear(KUrl)));
  72
  73     // Although the layout engine of KItemListView is fast it is very inefficient to e.g.
  74     // emit 50 itemsInserted()-signals each 100 ms. m_minimumUpdateIntervalTimer assures that updates
  75     // are done in 1 second intervals for equal operations.
  76     m_minimumUpdateIntervalTimer = new QTimer(this);
  77     m_minimumUpdateIntervalTimer->setInterval(1000);
  78     m_minimumUpdateIntervalTimer->setSingleShot(true);
  79     connect(m_minimumUpdateIntervalTimer, SIGNAL(timeout()), this, SLOT(dispatchPendingItemsToInsert()));
  80
  81     // For slow KIO-slaves like used for searching it makes sense to show results periodically even
  82     // before the completed() or canceled() signal has been emitted.
  83     m_maximumUpdateIntervalTimer = new QTimer(this);
  84     m_maximumUpdateIntervalTimer->setInterval(2000);
  85     m_maximumUpdateIntervalTimer->setSingleShot(true);
  86     connect(m_maximumUpdateIntervalTimer, SIGNAL(timeout()), this, SLOT(dispatchPendingItemsToInsert()));
  87
  88     // When changing the value of an item which represents the sort-role a resorting must be
  89     // triggered. Especially in combination with KFileItemModelRolesUpdater this might be done
  90     // for a lot of items within a quite small timeslot. To prevent expensive resortings the
  91     // resorting is postponed until the timer has been exceeded.
  92     m_resortAllItemsTimer = new QTimer(this);
  93     m_resortAllItemsTimer->setInterval(500);
  94     m_resortAllItemsTimer->setSingleShot(true);
  95     connect(m_resortAllItemsTimer, SIGNAL(timeout()), this, SLOT(resortAllItems()));
  96
  97     Q_ASSERT(m_minimumUpdateIntervalTimer->interval() <= m_maximumUpdateIntervalTimer->interval());
  98 }
  99
 100 KFileItemModel::~KFileItemModel()
 101 {
 102     qDeleteAll(m_itemData);
 103     m_itemData.clear();
 104 }
 105
 106 int KFileItemModel::count() const
 107 {
 108     return m_itemData.count();
 109 }
 110
 111 QHash<QByteArray, QVariant> KFileItemModel::data(int index) const
 112 {
 113     if (index >= 0 && index < count()) {
 114         return m_itemData.at(index)->values;
 115     }
 116     return QHash<QByteArray, QVariant>();
 117 }
 118
 119 bool KFileItemModel::setData(int index, const QHash<QByteArray, QVariant>& values)
 120 {
 121     if (index < 0 || index >= count()) {
 122         return false;
 123     }
 124
 125     QHash<QByteArray, QVariant> currentValues = m_itemData.at(index)->values;
 126
 127     // Determine which roles have been changed
 128     QSet<QByteArray> changedRoles;
 129     QHashIterator<QByteArray, QVariant> it(values);
 130     while (it.hasNext()) {
 131         it.next();
 132         const QByteArray role = it.key();
 133         const QVariant value = it.value();
 134
 135         if (currentValues[role] != value) {
 136             currentValues[role] = value;
 137             changedRoles.insert(role);
 138         }
 139     }
 140
 141     if (changedRoles.isEmpty()) {
 142         return false;
 143     }
 144
 145     m_itemData[index]->values = currentValues;
 146     emit itemsChanged(KItemRangeList() << KItemRange(index, 1), changedRoles);
 147
 148     if (changedRoles.contains(sortRole())) {
 149         m_resortAllItemsTimer->start();
 150     }
 151
 152     return true;
 153 }
 154
 155 void KFileItemModel::setSortFoldersFirst(bool foldersFirst)
 156 {
 157     if (foldersFirst != m_sortFoldersFirst) {
 158         m_sortFoldersFirst = foldersFirst;
 159         resortAllItems();
 160     }
 161 }
 162
 163 bool KFileItemModel::sortFoldersFirst() const
 164 {
 165     return m_sortFoldersFirst;
 166 }
 167
 168 void KFileItemModel::setShowHiddenFiles(bool show)
 169 {
 170     KDirLister* dirLister = m_dirLister.data();
 171     if (dirLister) {
 172         dirLister->setShowingDotFiles(show);
 173         dirLister->emitChanges();
 174         if (show) {
 175             slotCompleted();
 176         }
 177     }
 178 }
 179
 180 bool KFileItemModel::showHiddenFiles() const
 181 {
 182     const KDirLister* dirLister = m_dirLister.data();
 183     return dirLister ? dirLister->showingDotFiles() : false;
 184 }
 185
 186 QMimeData* KFileItemModel::createMimeData(const QSet<int>& indexes) const
 187 {
 188     QMimeData* data = new QMimeData();
 189
 190     // The following code has been taken from KDirModel::mimeData()
 191     // (kdelibs/kio/kio/kdirmodel.cpp)
 192     // Copyright (C) 2006 David Faure <faure@kde.org>
 193     KUrl::List urls;
 194     KUrl::List mostLocalUrls;
 195     bool canUseMostLocalUrls = true;
 196
 197     QSetIterator<int> it(indexes);
 198     while (it.hasNext()) {
 199         const int index = it.next();
 200         const KFileItem item = fileItem(index);
 201         if (!item.isNull()) {
 202             urls << item.url();
 203
 204             bool isLocal;
 205             mostLocalUrls << item.mostLocalUrl(isLocal);
 206             if (!isLocal) {
 207                 canUseMostLocalUrls = false;
 208             }
 209         }
 210     }
 211
 212     const bool different = canUseMostLocalUrls && mostLocalUrls != urls;
 213     urls = KDirModel::simplifiedUrlList(urls); // TODO: Check if we still need KDirModel for this in KDE 5.0
 214     if (different) {
 215         mostLocalUrls = KDirModel::simplifiedUrlList(mostLocalUrls);
 216         urls.populateMimeData(mostLocalUrls, data);
 217     } else {
 218         urls.populateMimeData(data);
 219     }
 220
 221     return data;
 222 }
 223
 224 int KFileItemModel::indexForKeyboardSearch(const QString& text, int startFromIndex) const
 225 {
 226     startFromIndex = qMax(0, startFromIndex);
 227     for (int i = startFromIndex; i < count(); ++i) {
 228         if (data(i)["name"].toString().startsWith(text, Qt::CaseInsensitive)) {
 229             return i;
 230         }
 231     }
 232     for (int i = 0; i < startFromIndex; ++i) {
 233         if (data(i)["name"].toString().startsWith(text, Qt::CaseInsensitive)) {
 234             return i;
 235         }
 236     }
 237     return -1;
 238 }
 239
 240 bool KFileItemModel::supportsDropping(int index) const
 241 {
 242     const KFileItem item = fileItem(index);
 243     return item.isNull() ? false : item.isDir();
 244 }
 245
 246 QString KFileItemModel::roleDescription(const QByteArray& role) const
 247 {
 248     QString descr;
 249
 250     switch (roleIndex(role)) {
 251     case NameRole:           descr = i18nc("@item:intable", "Name"); break;
 252     case SizeRole:           descr = i18nc("@item:intable", "Size"); break;
 253     case DateRole:           descr = i18nc("@item:intable", "Date"); break;
 254     case PermissionsRole:    descr = i18nc("@item:intable", "Permissions"); break;
 255     case OwnerRole:          descr = i18nc("@item:intable", "Owner"); break;
 256     case GroupRole:          descr = i18nc("@item:intable", "Group"); break;
 257     case TypeRole:           descr = i18nc("@item:intable", "Type"); break;
 258     case DestinationRole:    descr = i18nc("@item:intable", "Destination"); break;
 259     case PathRole:           descr = i18nc("@item:intable", "Path"); break;
 260     case CommentRole:        descr = i18nc("@item:intable", "Comment"); break;
 261     case TagsRole:           descr = i18nc("@item:intable", "Tags"); break;
 262     case RatingRole:         descr = i18nc("@item:intable", "Rating"); break;
 263     case NoRole:             break;
 264     case IsDirRole:          break;
 265     case IsExpandedRole:     break;
 266     case ExpansionLevelRole: break;
 267     default:                 Q_ASSERT(false); break;
 268     }
 269
 270     return descr;
 271 }
 272
 273 QList<QPair<int, QVariant> > KFileItemModel::groups() const
 274 {
 275     if (!m_itemData.isEmpty() && m_groups.isEmpty()) {
 276 #ifdef KFILEITEMMODEL_DEBUG
 277         QElapsedTimer timer;
 278         timer.start();
 279 #endif
 280         switch (roleIndex(sortRole())) {
 281         case NameRole:           m_groups = nameRoleGroups(); break;
 282         case SizeRole:           m_groups = sizeRoleGroups(); break;
 283         case DateRole:           m_groups = dateRoleGroups(); break;
 284         case PermissionsRole:    m_groups = permissionRoleGroups(); break;
 285         case OwnerRole:          m_groups = genericStringRoleGroups("owner"); break;
 286         case GroupRole:          m_groups = genericStringRoleGroups("group"); break;
 287         case TypeRole:           m_groups = genericStringRoleGroups("type"); break;
 288         case DestinationRole:    m_groups = genericStringRoleGroups("destination"); break;
 289         case PathRole:           m_groups = genericStringRoleGroups("path"); break;
 290         case CommentRole:        m_groups = genericStringRoleGroups("comment"); break;
 291         case TagsRole:           m_groups = genericStringRoleGroups("tags"); break;
 292         case RatingRole:         m_groups = ratingRoleGroups(); break;
 293         case NoRole:             break;
 294         case IsDirRole:          break;
 295         case IsExpandedRole:     break;
 296         case ExpansionLevelRole: break;
 297         default:                 Q_ASSERT(false); break;
 298         }
 299
 300 #ifdef KFILEITEMMODEL_DEBUG
 301         kDebug() << "[TIME] Calculating groups for" << count() << "items:" << timer.elapsed();
 302 #endif
 303     }
 304
 305     return m_groups;
 306 }
 307
 308 KFileItem KFileItemModel::fileItem(int index) const
 309 {
 310     if (index >= 0 && index < count()) {
 311         return m_itemData.at(index)->item;
 312     }
 313
 314     return KFileItem();
 315 }
 316
 317 KFileItem KFileItemModel::fileItem(const KUrl& url) const
 318 {
 319     const int index = m_items.value(url, -1);
 320     if (index >= 0) {
 321         return m_itemData.at(index)->item;
 322     }
 323     return KFileItem();
 324 }
 325
 326 int KFileItemModel::index(const KFileItem& item) const
 327 {
 328     if (item.isNull()) {
 329         return -1;
 330     }
 331
 332     return m_items.value(item.url(), -1);
 333 }
 334
 335 int KFileItemModel::index(const KUrl& url) const
 336 {
 337     KUrl urlToFind = url;
 338     urlToFind.adjustPath(KUrl::RemoveTrailingSlash);
 339     return m_items.value(urlToFind, -1);
 340 }
 341
 342 KFileItem KFileItemModel::rootItem() const
 343 {
 344     const KDirLister* dirLister = m_dirLister.data();
 345     if (dirLister) {
 346         return dirLister->rootItem();
 347     }
 348     return KFileItem();
 349 }
 350
 351 void KFileItemModel::clear()
 352 {
 353     slotClear();
 354 }
 355
 356 void KFileItemModel::setRoles(const QSet<QByteArray>& roles)
 357 {
 358     m_roles = roles;
 359
 360     if (count() > 0) {
 361         const bool supportedExpanding = m_requestRole[IsExpandedRole] && m_requestRole[ExpansionLevelRole];
 362         const bool willSupportExpanding = roles.contains("isExpanded") && roles.contains("expansionLevel");
 363         if (supportedExpanding && !willSupportExpanding) {
 364             // No expanding is supported anymore. Take care to delete all items that have an expansion level
 365             // that is not 0 (and hence are part of an expanded item).
 366             removeExpandedItems();
 367         }
 368     }
 369
 370     resetRoles();
 371
 372     QSetIterator<QByteArray> it(roles);
 373     while (it.hasNext()) {
 374         const QByteArray& role = it.next();
 375         m_requestRole[roleIndex(role)] = true;
 376     }
 377
 378     if (count() > 0) {
 379         // Update m_data with the changed requested roles
 380         const int maxIndex = count() - 1;
 381         for (int i = 0; i <= maxIndex; ++i) {
 382             m_itemData[i]->values = retrieveData(m_itemData.at(i)->item);
 383         }
 384
 385         kWarning() << "TODO: Emitting itemsChanged() with no information what has changed!";
 386         emit itemsChanged(KItemRangeList() << KItemRange(0, count()), QSet<QByteArray>());
 387     }
 388 }
 389
 390 QSet<QByteArray> KFileItemModel::roles() const
 391 {
 392     return m_roles;
 393 }
 394
 395 bool KFileItemModel::setExpanded(int index, bool expanded)
 396 {
 397     if (isExpanded(index) == expanded || index < 0 || index >= count()) {
 398         return false;
 399     }
 400
 401     QHash<QByteArray, QVariant> values;
 402     values.insert("isExpanded", expanded);
 403     if (!setData(index, values)) {
 404         return false;
 405     }
 406
 407     KDirLister* dirLister = m_dirLister.data();
 408     const KUrl url = m_itemData.at(index)->item.url();
 409     if (expanded) {
 410         m_expandedUrls.insert(url);
 411
 412         if (dirLister) {
 413             dirLister->openUrl(url, KDirLister::Keep);
 414             return true;
 415         }
 416     } else {
 417         m_expandedUrls.remove(url);
 418
 419         if (dirLister) {
 420             dirLister->stop(url);
 421         }
 422
 423         KFileItemList itemsToRemove;
 424         const int expansionLevel = data(index)["expansionLevel"].toInt();
 425         ++index;
 426         while (index < count() && data(index)["expansionLevel"].toInt() > expansionLevel) {
 427             itemsToRemove.append(m_itemData.at(index)->item);
 428             ++index;
 429         }
 430         removeItems(itemsToRemove);
 431         return true;
 432     }
 433
 434     return false;
 435 }
 436
 437 bool KFileItemModel::isExpanded(int index) const
 438 {
 439     if (index >= 0 && index < count()) {
 440         return m_itemData.at(index)->values.value("isExpanded").toBool();
 441     }
 442     return false;
 443 }
 444
 445 bool KFileItemModel::isExpandable(int index) const
 446 {
 447     if (index >= 0 && index < count()) {
 448         return m_itemData.at(index)->item.isDir();
 449     }
 450     return false;
 451 }
 452
 453 QSet<KUrl> KFileItemModel::expandedUrls() const
 454 {
 455     return m_expandedUrls;
 456 }
 457
 458 void KFileItemModel::restoreExpandedUrls(const QSet<KUrl>& urls)
 459 {
 460     m_urlsToExpand = urls;
 461 }
 462
 463 void KFileItemModel::setExpanded(const QSet<KUrl>& urls)
 464 {
 465
 466     const KDirLister* dirLister = m_dirLister.data();
 467     if (!dirLister) {
 468         return;
 469     }
 470
 471     const int pos = dirLister->url().url().length();
 472
 473     // Assure that each sub-path of the URLs that should be
 474     // expanded is added to m_urlsToExpand too. KDirLister
 475     // does not care whether the parent-URL has already been
 476     // expanded.
 477     QSetIterator<KUrl> it1(urls);
 478     while (it1.hasNext()) {
 479         const KUrl& url = it1.next();
 480
 481         KUrl urlToExpand = dirLister->url();
 482         const QStringList subDirs = url.url().mid(pos).split(QDir::separator());
 483         for (int i = 0; i < subDirs.count(); ++i) {
 484             urlToExpand.addPath(subDirs.at(i));
 485             m_urlsToExpand.insert(urlToExpand);
 486         }
 487     }
 488
 489     // KDirLister::open() must called at least once to trigger an initial
 490     // loading. The pending URLs that must be restored are handled
 491     // in slotCompleted().
 492     QSetIterator<KUrl> it2(m_urlsToExpand);
 493     while (it2.hasNext()) {
 494         const int idx = index(it2.next());
 495         if (idx >= 0 && !isExpanded(idx)) {
 496             setExpanded(idx, true);
 497             break;
 498         }
 499     }
 500 }
 501
 502 void KFileItemModel::setNameFilter(const QString& nameFilter)
 503 {
 504     if (m_filter.pattern() != nameFilter) {
 505         dispatchPendingItemsToInsert();
 506
 507         m_filter.setPattern(nameFilter);
 508
 509         // Check which shown items from m_itemData must get
 510         // hidden and hence moved to m_filteredItems.
 511         KFileItemList newFilteredItems;
 512
 513         foreach (ItemData* itemData, m_itemData) {
 514             if (!m_filter.matches(itemData->item)) {
 515                 // Only filter non-expanded items as child items may never
 516                 // exist without a parent item
 517                 if (!itemData->values.value("isExpanded").toBool()) {
 518                     newFilteredItems.append(itemData->item);
 519                     m_filteredItems.insert(itemData->item);
 520                 }
 521             }
 522         }
 523
 524         removeItems(newFilteredItems);
 525
 526         // Check which hidden items from m_filteredItems should
 527         // get visible again and hence removed from m_filteredItems.
 528         KFileItemList newVisibleItems;
 529
 530         QMutableSetIterator<KFileItem> it(m_filteredItems);
 531         while (it.hasNext()) {
 532             const KFileItem item = it.next();
 533             if (m_filter.matches(item)) {
 534                 newVisibleItems.append(item);
 535                 m_filteredItems.remove(item);
 536             }
 537         }
 538
 539         insertItems(newVisibleItems);
 540     }
 541 }
 542
 543 QString KFileItemModel::nameFilter() const
 544 {
 545     return m_filter.pattern();
 546 }
 547
 548 void KFileItemModel::onGroupedSortingChanged(bool current)
 549 {
 550     Q_UNUSED(current);
 551     m_groups.clear();
 552 }
 553
 554 void KFileItemModel::onSortRoleChanged(const QByteArray& current, const QByteArray& previous)
 555 {
 556     Q_UNUSED(previous);
 557     m_sortRole = roleIndex(current);
 558
 559 #ifdef KFILEITEMMODEL_DEBUG
 560     if (!m_requestRole[m_sortRole]) {
 561         kWarning() << "The sort-role has been changed to a role that has not been received yet";
 562     }
 563 #endif
 564
 565     resortAllItems();
 566 }
 567
 568 void KFileItemModel::onSortOrderChanged(Qt::SortOrder current, Qt::SortOrder previous)
 569 {
 570     Q_UNUSED(current);
 571     Q_UNUSED(previous);
 572     resortAllItems();
 573 }
 574
 575 void KFileItemModel::resortAllItems()
 576 {
 577     m_resortAllItemsTimer->stop();
 578
 579     const int itemCount = count();
 580     if (itemCount <= 0) {
 581         return;
 582     }
 583
 584 #ifdef KFILEITEMMODEL_DEBUG
 585     QElapsedTimer timer;
 586     timer.start();
 587     kDebug() << "===========================================================";
 588     kDebug() << "Resorting" << itemCount << "items";
 589 #endif
 590
 591     // Remember the order of the current URLs so
 592     // that it can be determined which indexes have
 593     // been moved because of the resorting.
 594     QList<KUrl> oldUrls;
 595     oldUrls.reserve(itemCount);
 596     foreach (const ItemData* itemData, m_itemData) {
 597         oldUrls.append(itemData->item.url());
 598     }
 599
 600     m_groups.clear();
 601     m_items.clear();
 602
 603     // Resort the items
 604     sort(m_itemData.begin(), m_itemData.end());
 605     for (int i = 0; i < itemCount; ++i) {
 606         m_items.insert(m_itemData.at(i)->item.url(), i);
 607     }
 608
 609     // Determine the indexes that have been moved
 610     bool emitItemsMoved = false;
 611     QList<int> movedToIndexes;
 612     movedToIndexes.reserve(itemCount);
 613     for (int i = 0; i < itemCount; i++) {
 614         const int newIndex = m_items.value(oldUrls.at(i).url());
 615         movedToIndexes.append(newIndex);
 616         if (!emitItemsMoved && newIndex != i) {
 617             emitItemsMoved = true;
 618         }
 619     }
 620
 621     if (emitItemsMoved) {
 622         emit itemsMoved(KItemRange(0, itemCount), movedToIndexes);
 623     }
 624
 625 #ifdef KFILEITEMMODEL_DEBUG
 626     kDebug() << "[TIME] Resorting of" << itemCount << "items:" << timer.elapsed();
 627 #endif
 628 }
 629
 630 void KFileItemModel::slotCompleted()
 631 {
 632     if (m_urlsToExpand.isEmpty() && m_minimumUpdateIntervalTimer->isActive()) {
 633         // dispatchPendingItems() will be called when the timer
 634         // has been expired.
 635         m_pendingEmitLoadingCompleted = true;
 636         return;
 637     }
 638
 639     m_pendingEmitLoadingCompleted = false;
 640     dispatchPendingItemsToInsert();
 641
 642     if (!m_urlsToExpand.isEmpty()) {
 643         // Try to find a URL that can be expanded.
 644         // Note that the parent folder must be expanded before any of its subfolders become visible.
 645         // Therefore, some URLs in m_restoredExpandedUrls might not be visible yet
 646         // -> we expand the first visible URL we find in m_restoredExpandedUrls.
 647         foreach(const KUrl& url, m_urlsToExpand) {
 648             const int index = m_items.value(url, -1);
 649             if (index >= 0) {
 650                 m_urlsToExpand.remove(url);
 651                 if (setExpanded(index, true)) {
 652                     // The dir lister has been triggered. This slot will be called
 653                     // again after the directory has been expanded.
 654                     return;
 655                 }
 656             }
 657         }
 658
 659         // None of the URLs in m_restoredExpandedUrls could be found in the model. This can happen
 660         // if these URLs have been deleted in the meantime.
 661         m_urlsToExpand.clear();
 662     }
 663
 664     emit loadingCompleted();
 665     m_minimumUpdateIntervalTimer->start();
 666 }
 667
 668 void KFileItemModel::slotCanceled()
 669 {
 670     m_minimumUpdateIntervalTimer->stop();
 671     m_maximumUpdateIntervalTimer->stop();
 672     dispatchPendingItemsToInsert();
 673 }
 674
 675 void KFileItemModel::slotNewItems(const KFileItemList& items)
 676 {
 677     if (m_requestRole[ExpansionLevelRole] && m_rootExpansionLevel >= 0) {
 678         // If the expanding of items is enabled in the model, it might be
 679         // possible that the call dirLister->openUrl(url, KDirLister::Keep) in
 680         // KFileItemModel::setExpanded() results in emitting of the same items
 681         // twice due to the Keep-parameter. This case happens if an item gets
 682         // expanded, collapsed and expanded again before the items could be loaded
 683         // for the first expansion.
 684         foreach (const KFileItem& item, items) {
 685             const int index = m_items.value(item.url(), -1);
 686             if (index >= 0) {
 687                 // The items are already part of the model.
 688                 return;
 689             }
 690         }
 691     }
 692
 693     if (m_filter.pattern().isEmpty()) {
 694         m_pendingItemsToInsert.append(items);
 695     } else {
 696         // The name-filter is active. Hide filtered items
 697         // before inserting them into the model and remember
 698         // the filtered items in m_filteredItems.
 699         KFileItemList filteredItems;
 700         foreach (const KFileItem& item, items) {
 701             if (m_filter.matches(item)) {
 702                 filteredItems.append(item);
 703             } else {
 704                 m_filteredItems.insert(item);
 705             }
 706         }
 707
 708         m_pendingItemsToInsert.append(filteredItems);
 709     }
 710
 711     if (useMaximumUpdateInterval() && !m_maximumUpdateIntervalTimer->isActive()) {
 712         // Assure that items get dispatched if no completed() or canceled() signal is
 713         // emitted during the maximum update interval.
 714         m_maximumUpdateIntervalTimer->start();
 715     }
 716 }
 717
 718 void KFileItemModel::slotItemsDeleted(const KFileItemList& items)
 719 {
 720     dispatchPendingItemsToInsert();
 721
 722     if (!m_filteredItems.isEmpty()) {
 723         foreach (const KFileItem& item, items) {
 724             m_filteredItems.remove(item);
 725         }
 726     }
 727
 728     removeItems(items);
 729 }
 730
 731 void KFileItemModel::slotRefreshItems(const QList<QPair<KFileItem, KFileItem> >& items)
 732 {
 733     Q_ASSERT(!items.isEmpty());
 734 #ifdef KFILEITEMMODEL_DEBUG
 735     kDebug() << "Refreshing" << items.count() << "items";
 736 #endif
 737
 738     m_groups.clear();
 739
 740     // Get the indexes of all items that have been refreshed
 741     QList<int> indexes;
 742     indexes.reserve(items.count());
 743
 744     QListIterator<QPair<KFileItem, KFileItem> > it(items);
 745     while (it.hasNext()) {
 746         const QPair<KFileItem, KFileItem>& itemPair = it.next();
 747         const KFileItem& oldItem = itemPair.first;
 748         const KFileItem& newItem = itemPair.second;
 749         const int index = m_items.value(oldItem.url(), -1);
 750         if (index >= 0) {
 751             m_itemData[index]->item = newItem;
 752             m_itemData[index]->values = retrieveData(newItem);
 753             m_items.remove(oldItem.url());
 754             m_items.insert(newItem.url(), index);
 755             indexes.append(index);
 756         }
 757     }
 758
 759     // If the changed items have been created recently, they might not be in m_items yet.
 760     // In that case, the list 'indexes' might be empty.
 761     if (indexes.isEmpty()) {
 762         return;
 763     }
 764
 765     // Extract the item-ranges out of the changed indexes
 766     qSort(indexes);
 767
 768     KItemRangeList itemRangeList;
 769     int previousIndex = indexes.at(0);
 770     int rangeIndex = previousIndex;
 771     int rangeCount = 1;
 772
 773     const int maxIndex = indexes.count() - 1;
 774     for (int i = 1; i <= maxIndex; ++i) {
 775         const int currentIndex = indexes.at(i);
 776         if (currentIndex == previousIndex + 1) {
 777             ++rangeCount;
 778         } else {
 779             itemRangeList.append(KItemRange(rangeIndex, rangeCount));
 780
 781             rangeIndex = currentIndex;
 782             rangeCount = 1;
 783         }
 784         previousIndex = currentIndex;
 785     }
 786
 787     if (rangeCount > 0) {
 788         itemRangeList.append(KItemRange(rangeIndex, rangeCount));
 789     }
 790
 791     emit itemsChanged(itemRangeList, m_roles);
 792
 793     resortAllItems();
 794 }
 795
 796 void KFileItemModel::slotClear()
 797 {
 798 #ifdef KFILEITEMMODEL_DEBUG
 799     kDebug() << "Clearing all items";
 800 #endif
 801
 802     m_filteredItems.clear();
 803     m_groups.clear();
 804
 805     m_minimumUpdateIntervalTimer->stop();
 806     m_maximumUpdateIntervalTimer->stop();
 807     m_resortAllItemsTimer->stop();
 808     m_pendingItemsToInsert.clear();
 809
 810     m_rootExpansionLevel = UninitializedRootExpansionLevel;
 811
 812     const int removedCount = m_itemData.count();
 813     if (removedCount > 0) {
 814         qDeleteAll(m_itemData);
 815         m_itemData.clear();
 816         m_items.clear();
 817         emit itemsRemoved(KItemRangeList() << KItemRange(0, removedCount));
 818     }
 819
 820     m_expandedUrls.clear();
 821 }
 822
 823 void KFileItemModel::slotClear(const KUrl& url)
 824 {
 825     Q_UNUSED(url);
 826 }
 827
 828 void KFileItemModel::dispatchPendingItemsToInsert()
 829 {
 830     if (!m_pendingItemsToInsert.isEmpty()) {
 831         insertItems(m_pendingItemsToInsert);
 832         m_pendingItemsToInsert.clear();
 833     }
 834
 835     if (m_pendingEmitLoadingCompleted) {
 836         emit loadingCompleted();
 837     }
 838 }
 839
 840 void KFileItemModel::insertItems(const KFileItemList& items)
 841 {
 842     if (items.isEmpty()) {
 843         return;
 844     }
 845
 846 #ifdef KFILEITEMMODEL_DEBUG
 847     QElapsedTimer timer;
 848     timer.start();
 849     kDebug() << "===========================================================";
 850     kDebug() << "Inserting" << items.count() << "items";
 851 #endif
 852
 853     m_groups.clear();
 854
 855     QList<ItemData*> sortedItems = createItemDataList(items);
 856     sort(sortedItems.begin(), sortedItems.end());
 857
 858 #ifdef KFILEITEMMODEL_DEBUG
 859     kDebug() << "[TIME] Sorting:" << timer.elapsed();
 860 #endif
 861
 862     KItemRangeList itemRanges;
 863     int targetIndex = 0;
 864     int sourceIndex = 0;
 865     int insertedAtIndex = -1;        // Index for the current item-range
 866     int insertedCount = 0;           // Count for the current item-range
 867     int previouslyInsertedCount = 0; // Sum of previously inserted items for all ranges
 868     while (sourceIndex < sortedItems.count()) {
 869         // Find target index from m_items to insert the current item
 870         // in a sorted order
 871         const int previousTargetIndex = targetIndex;
 872         while (targetIndex < m_itemData.count()) {
 873             if (!lessThan(m_itemData.at(targetIndex), sortedItems.at(sourceIndex))) {
 874                 break;
 875             }
 876             ++targetIndex;
 877         }
 878
 879         if (targetIndex - previousTargetIndex > 0 && insertedAtIndex >= 0) {
 880             itemRanges << KItemRange(insertedAtIndex, insertedCount);
 881             previouslyInsertedCount += insertedCount;
 882             insertedAtIndex = targetIndex - previouslyInsertedCount;
 883             insertedCount = 0;
 884         }
 885
 886         // Insert item at the position targetIndex by transfering
 887         // the ownership of the item-data from sortedItems to m_itemData.
 888         // m_items will be inserted after the loop (see comment below)
 889         m_itemData.insert(targetIndex, sortedItems.at(sourceIndex));
 890         ++insertedCount;
 891
 892         if (insertedAtIndex < 0) {
 893             insertedAtIndex = targetIndex;
 894             Q_ASSERT(previouslyInsertedCount == 0);
 895         }
 896         ++targetIndex;
 897         ++sourceIndex;
 898     }
 899
 900     // The indexes of all m_items must be adjusted, not only the index
 901     // of the new items
 902     const int itemDataCount = m_itemData.count();
 903     for (int i = 0; i < itemDataCount; ++i) {
 904         m_items.insert(m_itemData.at(i)->item.url(), i);
 905     }
 906
 907     itemRanges << KItemRange(insertedAtIndex, insertedCount);
 908     emit itemsInserted(itemRanges);
 909
 910 #ifdef KFILEITEMMODEL_DEBUG
 911     kDebug() << "[TIME] Inserting of" << items.count() << "items:" << timer.elapsed();
 912 #endif
 913 }
 914
 915 void KFileItemModel::removeItems(const KFileItemList& items)
 916 {
 917     if (items.isEmpty()) {
 918         return;
 919     }
 920
 921 #ifdef KFILEITEMMODEL_DEBUG
 922     kDebug() << "Removing " << items.count() << "items";
 923 #endif
 924
 925     m_groups.clear();
 926
 927     QList<ItemData*> sortedItems;
 928     sortedItems.reserve(items.count());
 929     foreach (const KFileItem& item, items) {
 930         const int index = m_items.value(item.url(), -1);
 931         if (index >= 0) {
 932             sortedItems.append(m_itemData.at(index));
 933         }
 934     }
 935     sort(sortedItems.begin(), sortedItems.end());
 936
 937     QList<int> indexesToRemove;
 938     indexesToRemove.reserve(items.count());
 939
 940     // Calculate the item ranges that will get deleted
 941     KItemRangeList itemRanges;
 942     int removedAtIndex = -1;
 943     int removedCount = 0;
 944     int targetIndex = 0;
 945     foreach (const ItemData* itemData, sortedItems) {
 946         const KFileItem& itemToRemove = itemData->item;
 947
 948         const int previousTargetIndex = targetIndex;
 949         while (targetIndex < m_itemData.count()) {
 950             if (m_itemData.at(targetIndex)->item.url() == itemToRemove.url()) {
 951                 break;
 952             }
 953             ++targetIndex;
 954         }
 955         if (targetIndex >= m_itemData.count()) {
 956             kWarning() << "Item that should be deleted has not been found!";
 957             return;
 958         }
 959
 960         if (targetIndex - previousTargetIndex > 0 && removedAtIndex >= 0) {
 961             itemRanges << KItemRange(removedAtIndex, removedCount);
 962             removedAtIndex = targetIndex;
 963             removedCount = 0;
 964         }
 965
 966         indexesToRemove.append(targetIndex);
 967         if (removedAtIndex < 0) {
 968             removedAtIndex = targetIndex;
 969         }
 970         ++removedCount;
 971         ++targetIndex;
 972     }
 973
 974     // Delete the items
 975     for (int i = indexesToRemove.count() - 1; i >= 0; --i) {
 976         const int indexToRemove = indexesToRemove.at(i);
 977         ItemData* data = m_itemData.at(indexToRemove);
 978
 979         m_items.remove(data->item.url());
 980
 981         delete data;
 982         m_itemData.removeAt(indexToRemove);
 983     }
 984
 985     // The indexes of all m_items must be adjusted, not only the index
 986     // of the removed items
 987     const int itemDataCount = m_itemData.count();
 988     for (int i = 0; i < itemDataCount; ++i) {
 989         m_items.insert(m_itemData.at(i)->item.url(), i);
 990     }
 991
 992     if (count() <= 0) {
 993         m_rootExpansionLevel = UninitializedRootExpansionLevel;
 994     }
 995
 996     itemRanges << KItemRange(removedAtIndex, removedCount);
 997     emit itemsRemoved(itemRanges);
 998 }
 999
1000 QList<KFileItemModel::ItemData*> KFileItemModel::createItemDataList(const KFileItemList& items) const
1001 {
1002     QList<ItemData*> itemDataList;
1003     itemDataList.reserve(items.count());
1004
1005     foreach (const KFileItem& item, items) {
1006         ItemData* itemData = new ItemData();
1007         itemData->item = item;
1008         itemData->values = retrieveData(item);
1009         itemData->parent = 0;
1010
1011         const bool determineParent = m_requestRole[ExpansionLevelRole]
1012                                      && itemData->values["expansionLevel"].toInt() > 0;
1013         if (determineParent) {
1014             KUrl parentUrl = item.url().upUrl();
1015             parentUrl.adjustPath(KUrl::RemoveTrailingSlash);
1016             const int parentIndex = m_items.value(parentUrl, -1);
1017             if (parentIndex >= 0) {
1018                 itemData->parent = m_itemData.at(parentIndex);
1019             } else {
1020                 kWarning() << "Parent item not found for" << item.url();
1021             }
1022         }
1023
1024         itemDataList.append(itemData);
1025     }
1026
1027     return itemDataList;
1028 }
1029
1030 void KFileItemModel::removeExpandedItems()
1031 {
1032     KFileItemList expandedItems;
1033
1034     const int maxIndex = m_itemData.count() - 1;
1035     for (int i = 0; i <= maxIndex; ++i) {
1036         const ItemData* itemData = m_itemData.at(i);
1037         if (itemData->values.value("expansionLevel").toInt() > 0) {
1038             expandedItems.append(itemData->item);
1039         }
1040     }
1041
1042     // The m_rootExpansionLevel may not get reset before all items with
1043     // a bigger expansionLevel have been removed.
1044     Q_ASSERT(m_rootExpansionLevel >= 0);
1045     removeItems(expandedItems);
1046
1047     m_rootExpansionLevel = UninitializedRootExpansionLevel;
1048     m_expandedUrls.clear();
1049 }
1050
1051 void KFileItemModel::resetRoles()
1052 {
1053     for (int i = 0; i < RolesCount; ++i) {
1054         m_requestRole[i] = false;
1055     }
1056 }
1057
1058 KFileItemModel::Role KFileItemModel::roleIndex(const QByteArray& role) const
1059 {
1060     static QHash<QByteArray, Role> rolesHash;
1061     if (rolesHash.isEmpty()) {
1062         rolesHash.insert("name", NameRole);
1063         rolesHash.insert("size", SizeRole);
1064         rolesHash.insert("date", DateRole);
1065         rolesHash.insert("permissions", PermissionsRole);
1066         rolesHash.insert("owner", OwnerRole);
1067         rolesHash.insert("group", GroupRole);
1068         rolesHash.insert("type", TypeRole);
1069         rolesHash.insert("destination", DestinationRole);
1070         rolesHash.insert("path", PathRole);
1071         rolesHash.insert("comment", CommentRole);
1072         rolesHash.insert("tags", TagsRole);
1073         rolesHash.insert("rating", RatingRole);
1074         rolesHash.insert("isDir", IsDirRole);
1075         rolesHash.insert("isExpanded", IsExpandedRole);
1076         rolesHash.insert("expansionLevel", ExpansionLevelRole);
1077     }
1078     return rolesHash.value(role, NoRole);
1079 }
1080
1081 QHash<QByteArray, QVariant> KFileItemModel::retrieveData(const KFileItem& item) const
1082 {
1083     // It is important to insert only roles that are fast to retrieve. E.g.
1084     // KFileItem::iconName() can be very expensive if the MIME-type is unknown
1085     // and hence will be retrieved asynchronously by KFileItemModelRolesUpdater.
1086     QHash<QByteArray, QVariant> data;
1087     data.insert("iconPixmap", QPixmap());
1088     data.insert("url", item.url());
1089
1090     const bool isDir = item.isDir();
1091     if (m_requestRole[IsDirRole]) {
1092         data.insert("isDir", isDir);
1093     }
1094
1095     if (m_requestRole[NameRole]) {
1096         data.insert("name", item.text());
1097     }
1098
1099     if (m_requestRole[SizeRole]) {
1100         if (isDir) {
1101             data.insert("size", QVariant());
1102         } else {
1103             data.insert("size", item.size());
1104         }
1105     }
1106
1107     if (m_requestRole[DateRole]) {
1108         // Don't use KFileItem::timeString() as this is too expensive when
1109         // having several thousands of items. Instead the formatting of the
1110         // date-time will be done on-demand by the view when the date will be shown.
1111         const KDateTime dateTime = item.time(KFileItem::ModificationTime);
1112         data.insert("date", dateTime.dateTime());
1113     }
1114
1115     if (m_requestRole[PermissionsRole]) {
1116         data.insert("permissions", item.permissionsString());
1117     }
1118
1119     if (m_requestRole[OwnerRole]) {
1120         data.insert("owner", item.user());
1121     }
1122
1123     if (m_requestRole[GroupRole]) {
1124         data.insert("group", item.group());
1125     }
1126
1127     if (m_requestRole[DestinationRole]) {
1128         QString destination = item.linkDest();
1129         if (destination.isEmpty()) {
1130             destination = i18nc("@item:intable", "No destination");
1131         }
1132         data.insert("destination", destination);
1133     }
1134
1135     if (m_requestRole[PathRole]) {
1136         data.insert("path", item.localPath());
1137     }
1138
1139     if (m_requestRole[IsExpandedRole]) {
1140         data.insert("isExpanded", false);
1141     }
1142
1143     if (m_requestRole[ExpansionLevelRole]) {
1144         if (m_rootExpansionLevel == UninitializedRootExpansionLevel && m_dirLister.data()) {
1145             const KUrl rootUrl = m_dirLister.data()->url();
1146             const QString protocol = rootUrl.protocol();
1147             const bool isSearchUrl = (protocol.contains("search") || protocol == QLatin1String("nepomuk"));
1148             if (isSearchUrl) {
1149                 m_rootExpansionLevel = ForceRootExpansionLevel;
1150             } else {
1151                 const QString rootDir = rootUrl.directory(KUrl::AppendTrailingSlash);
1152                 m_rootExpansionLevel = rootDir.count('/');
1153                 if (m_rootExpansionLevel == 1) {
1154                     // Special case: The root is already reached and no parent is available
1155                     --m_rootExpansionLevel;
1156                 }
1157             }
1158         }
1159
1160         if (m_rootExpansionLevel == ForceRootExpansionLevel) {
1161             data.insert("expansionLevel", 0);
1162         } else {
1163             const QString dir = item.url().directory(KUrl::AppendTrailingSlash);
1164             const int level = dir.count('/') - m_rootExpansionLevel - 1;
1165             data.insert("expansionLevel", level);
1166         }
1167     }
1168
1169     if (item.isMimeTypeKnown()) {
1170         data.insert("iconName", item.iconName());
1171
1172         if (m_requestRole[TypeRole]) {
1173             data.insert("type", item.mimeComment());
1174         }
1175     }
1176
1177     return data;
1178 }
1179
1180 bool KFileItemModel::lessThan(const ItemData* a, const ItemData* b) const
1181 {
1182     int result = 0;
1183
1184     if (m_rootExpansionLevel >= 0) {
1185         result = expansionLevelsCompare(a, b);
1186         if (result != 0) {
1187             // The items have parents with different expansion levels
1188             return (sortOrder() == Qt::AscendingOrder) ? result < 0 : result > 0;
1189         }
1190     }
1191
1192     if (m_sortFoldersFirst || m_sortRole == SizeRole) {
1193         const bool isDirA = a->item.isDir();
1194         const bool isDirB = b->item.isDir();
1195         if (isDirA && !isDirB) {
1196             return true;
1197         } else if (!isDirA && isDirB) {
1198             return false;
1199         }
1200     }
1201
1202     result = sortRoleCompare(a, b);
1203
1204     return (sortOrder() == Qt::AscendingOrder) ? result < 0 : result > 0;
1205 }
1206
1207 int KFileItemModel::sortRoleCompare(const ItemData* a, const ItemData* b) const
1208 {
1209     const KFileItem& itemA = a->item;
1210     const KFileItem& itemB = b->item;
1211
1212     int result = 0;
1213
1214     switch (m_sortRole) {
1215     case NameRole:
1216         // The name role is handled as default fallback after the switch
1217         break;
1218
1219     case DateRole: {
1220         const KDateTime dateTimeA = itemA.time(KFileItem::ModificationTime);
1221         const KDateTime dateTimeB = itemB.time(KFileItem::ModificationTime);
1222         if (dateTimeA < dateTimeB) {
1223             result = -1;
1224         } else if (dateTimeA > dateTimeB) {
1225             result = +1;
1226         }
1227         break;
1228     }
1229
1230     case SizeRole: {
1231         if (itemA.isDir()) {
1232             Q_ASSERT(itemB.isDir()); // see "if (m_sortFoldersFirst || m_sortRole == SizeRole)" above
1233
1234             const QVariant valueA = a->values.value("size");
1235             const QVariant valueB = b->values.value("size");
1236
1237             if (valueA.isNull()) {
1238                 result = -1;
1239             } else if (valueB.isNull()) {
1240                 result = +1;
1241             } else {
1242                 result = valueA.value<KIO::filesize_t>() - valueB.value<KIO::filesize_t>();
1243             }
1244         } else {
1245             Q_ASSERT(!itemB.isDir()); // see "if (m_sortFoldersFirst || m_sortRole == SizeRole)" above
1246             result = itemA.size() - itemB.size();
1247         }
1248         break;
1249     }
1250
1251     case TypeRole: {
1252         result = QString::compare(a->values.value("type").toString(),
1253                                   b->values.value("type").toString());
1254         break;
1255     }
1256
1257     case CommentRole: {
1258         result = QString::compare(a->values.value("comment").toString(),
1259                                   b->values.value("comment").toString());
1260         break;
1261     }
1262
1263     case TagsRole: {
1264         result = QString::compare(a->values.value("tags").toString(),
1265                                   b->values.value("tags").toString());
1266         break;
1267     }
1268
1269     case RatingRole: {
1270         result = a->values.value("rating").toInt() - b->values.value("rating").toInt();
1271         break;
1272     }
1273
1274     default:
1275         break;
1276     }
1277
1278     if (result != 0) {
1279         // The current sort role was sufficient to define an order
1280         return result;
1281     }
1282
1283     // Fallback #1: Compare the text of the items
1284     result = stringCompare(itemA.text(), itemB.text());
1285     if (result != 0) {
1286         return result;
1287     }
1288
1289     // Fallback #2: KFileItem::text() may not be unique in case UDS_DISPLAY_NAME is used
1290     result = stringCompare(itemA.name(m_caseSensitivity == Qt::CaseInsensitive),
1291                            itemB.name(m_caseSensitivity == Qt::CaseInsensitive));
1292     if (result != 0) {
1293         return result;
1294     }
1295
1296     // Fallback #3: It must be assured that the sort order is always unique even if two values have been
1297     // equal. In this case a comparison of the URL is done which is unique in all cases
1298     // within KDirLister.
1299     return QString::compare(itemA.url().url(), itemB.url().url(), Qt::CaseSensitive);
1300 }
1301
1302 void KFileItemModel::sort(QList<ItemData*>::iterator begin,
1303                           QList<ItemData*>::iterator end)
1304 {
1305     // The implementation is based on qStableSortHelper() from qalgorithms.h
1306     // Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
1307     // In opposite to qStableSort() it allows to use a member-function for the comparison of elements.
1308
1309     const int span = end - begin;
1310     if (span < 2) {
1311         return;
1312     }
1313
1314     const QList<ItemData*>::iterator middle = begin + span / 2;
1315     sort(begin, middle);
1316     sort(middle, end);
1317     merge(begin, middle, end);
1318 }
1319
1320 void KFileItemModel::merge(QList<ItemData*>::iterator begin,
1321                            QList<ItemData*>::iterator pivot,
1322                            QList<ItemData*>::iterator end)
1323 {
1324     // The implementation is based on qMerge() from qalgorithms.h
1325     // Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
1326
1327     const int len1 = pivot - begin;
1328     const int len2 = end - pivot;
1329
1330     if (len1 == 0 || len2 == 0) {
1331         return;
1332     }
1333
1334     if (len1 + len2 == 2) {
1335         if (lessThan(*(begin + 1), *(begin))) {
1336             qSwap(*begin, *(begin + 1));
1337         }
1338         return;
1339     }
1340
1341     QList<ItemData*>::iterator firstCut;
1342     QList<ItemData*>::iterator secondCut;
1343     int len2Half;
1344     if (len1 > len2) {
1345         const int len1Half = len1 / 2;
1346         firstCut = begin + len1Half;
1347         secondCut = lowerBound(pivot, end, *firstCut);
1348         len2Half = secondCut - pivot;
1349     } else {
1350         len2Half = len2 / 2;
1351         secondCut = pivot + len2Half;
1352         firstCut = upperBound(begin, pivot, *secondCut);
1353     }
1354
1355     reverse(firstCut, pivot);
1356     reverse(pivot, secondCut);
1357     reverse(firstCut, secondCut);
1358
1359     const QList<ItemData*>::iterator newPivot = firstCut + len2Half;
1360     merge(begin, firstCut, newPivot);
1361     merge(newPivot, secondCut, end);
1362 }
1363
1364 QList<KFileItemModel::ItemData*>::iterator KFileItemModel::lowerBound(QList<ItemData*>::iterator begin,
1365                                                                       QList<ItemData*>::iterator end,
1366                                                                       const ItemData* value)
1367 {
1368     // The implementation is based on qLowerBound() from qalgorithms.h
1369     // Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
1370
1371     QList<ItemData*>::iterator middle;
1372     int n = int(end - begin);
1373     int half;
1374
1375     while (n > 0) {
1376         half = n >> 1;
1377         middle = begin + half;
1378         if (lessThan(*middle, value)) {
1379             begin = middle + 1;
1380             n -= half + 1;
1381         } else {
1382             n = half;
1383         }
1384     }
1385     return begin;
1386 }
1387
1388 QList<KFileItemModel::ItemData*>::iterator KFileItemModel::upperBound(QList<ItemData*>::iterator begin,
1389                                                                       QList<ItemData*>::iterator end,
1390                                                                       const ItemData* value)
1391 {
1392     // The implementation is based on qUpperBound() from qalgorithms.h
1393     // Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
1394
1395     QList<ItemData*>::iterator middle;
1396     int n = end - begin;
1397     int half;
1398
1399     while (n > 0) {
1400         half = n >> 1;
1401         middle = begin + half;
1402         if (lessThan(value, *middle)) {
1403             n = half;
1404         } else {
1405             begin = middle + 1;
1406             n -= half + 1;
1407         }
1408     }
1409     return begin;
1410 }
1411
1412 void KFileItemModel::reverse(QList<ItemData*>::iterator begin,
1413                              QList<ItemData*>::iterator end)
1414 {
1415     // The implementation is based on qReverse() from qalgorithms.h
1416     // Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
1417
1418     --end;
1419     while (begin < end) {
1420         qSwap(*begin++, *end--);
1421     }
1422 }
1423
1424 int KFileItemModel::stringCompare(const QString& a, const QString& b) const
1425 {
1426     // Taken from KDirSortFilterProxyModel (kdelibs/kfile/kdirsortfilterproxymodel.*)
1427     // Copyright (C) 2006 by Peter Penz <peter.penz@gmx.at>
1428     // Copyright (C) 2006 by Dominic Battre <dominic@battre.de>
1429     // Copyright (C) 2006 by Martin Pool <mbp@canonical.com>
1430
1431     if (m_caseSensitivity == Qt::CaseInsensitive) {
1432         const int result = m_naturalSorting ? KStringHandler::naturalCompare(a, b, Qt::CaseInsensitive)
1433                                             : QString::compare(a, b, Qt::CaseInsensitive);
1434         if (result != 0) {
1435             // Only return the result, if the strings are not equal. If they are equal by a case insensitive
1436             // comparison, still a deterministic sort order is required. A case sensitive
1437             // comparison is done as fallback.
1438             return result;
1439         }
1440     }
1441
1442     return m_naturalSorting ? KStringHandler::naturalCompare(a, b, Qt::CaseSensitive)
1443                             : QString::compare(a, b, Qt::CaseSensitive);
1444 }
1445
1446 int KFileItemModel::expansionLevelsCompare(const ItemData* a, const ItemData* b) const
1447 {
1448     const KUrl urlA = a->item.url();
1449     const KUrl urlB = b->item.url();
1450     if (urlA.directory() == urlB.directory()) {
1451         // Both items have the same directory as parent
1452         return 0;
1453     }
1454
1455     // Check whether one item is the parent of the other item
1456     if (urlA.isParentOf(urlB)) {
1457         return (sortOrder() == Qt::AscendingOrder) ? -1 : +1;
1458     } else if (urlB.isParentOf(urlA)) {
1459         return (sortOrder() == Qt::AscendingOrder) ? +1 : -1;
1460     }
1461
1462     // Determine the maximum common path of both items and
1463     // remember the index in 'index'
1464     const QString pathA = urlA.path();
1465     const QString pathB = urlB.path();
1466
1467     const int maxIndex = qMin(pathA.length(), pathB.length()) - 1;
1468     int index = 0;
1469     while (index <= maxIndex && pathA.at(index) == pathB.at(index)) {
1470         ++index;
1471     }
1472     if (index > maxIndex) {
1473         index = maxIndex;
1474     }
1475     while ((pathA.at(index) != QLatin1Char('/') || pathB.at(index) != QLatin1Char('/')) && index > 0) {
1476         --index;
1477     }
1478
1479     // Determine the first sub-path after the common path and
1480     // check whether it represents a directory or already a file
1481     bool isDirA = true;
1482     const QString subPathA = subPath(a->item, pathA, index, &isDirA);
1483     bool isDirB = true;
1484     const QString subPathB = subPath(b->item, pathB, index, &isDirB);
1485
1486     if (isDirA && !isDirB) {
1487         return -1;
1488     } else if (!isDirA && isDirB) {
1489         return +1;
1490     }
1491
1492     // Compare the items of the parents that represent the first
1493     // different path after the common path.
1494     const KUrl parentUrlA(pathA.left(index) + subPathA);
1495     const KUrl parentUrlB(pathB.left(index) + subPathB);
1496
1497     const ItemData* parentA = a;
1498     while (parentA && parentA->item.url() != parentUrlA) {
1499         parentA = parentA->parent;
1500     }
1501
1502     const ItemData* parentB = b;
1503     while (parentB && parentB->item.url() != parentUrlB) {
1504         parentB = parentB->parent;
1505     }
1506
1507     if (parentA && parentB) {
1508         return sortRoleCompare(parentA, parentB);
1509     }
1510
1511     kWarning() << "Child items without parent detected:" << a->item.url() << b->item.url();
1512     return QString::compare(urlA.url(), urlB.url(), Qt::CaseSensitive);
1513 }
1514
1515 QString KFileItemModel::subPath(const KFileItem& item,
1516                                 const QString& itemPath,
1517                                 int start,
1518                                 bool* isDir) const
1519 {
1520     Q_ASSERT(isDir);
1521     const int pathIndex = itemPath.indexOf('/', start + 1);
1522     *isDir = (pathIndex > 0) || item.isDir();
1523     return itemPath.mid(start, pathIndex - start);
1524 }
1525
1526 bool KFileItemModel::useMaximumUpdateInterval() const
1527 {
1528     const KDirLister* dirLister = m_dirLister.data();
1529     return dirLister && !dirLister->url().isLocalFile();
1530 }
1531
1532 QList<QPair<int, QVariant> > KFileItemModel::nameRoleGroups() const
1533 {
1534     Q_ASSERT(!m_itemData.isEmpty());
1535
1536     const int maxIndex = count() - 1;
1537     QList<QPair<int, QVariant> > groups;
1538
1539     QString groupValue;
1540     QChar firstChar;
1541     bool isLetter = false;
1542     for (int i = 0; i <= maxIndex; ++i) {
1543         if (isChildItem(i)) {
1544             continue;
1545         }
1546
1547         const QString name = m_itemData.at(i)->values.value("name").toString();
1548
1549         // Use the first character of the name as group indication
1550         QChar newFirstChar = name.at(0).toUpper();
1551         if (newFirstChar == QLatin1Char('~') && name.length() > 1) {
1552             newFirstChar = name.at(1);
1553         }
1554
1555         if (firstChar != newFirstChar) {
1556             QString newGroupValue;
1557             if (newFirstChar >= QLatin1Char('A') && newFirstChar <= QLatin1Char('Z')) {
1558                 // Apply group 'A' - 'Z'
1559                 newGroupValue = newFirstChar;
1560                 isLetter = true;
1561             } else if (newFirstChar >= QLatin1Char('0') && newFirstChar <= QLatin1Char('9')) {
1562                 // Apply group '0 - 9' for any name that starts with a digit
1563                 newGroupValue = i18nc("@title:group Groups that start with a digit", "0 - 9");
1564                 isLetter = false;
1565             } else {
1566                 if (isLetter) {
1567                     // If the current group is 'A' - 'Z' check whether a locale character
1568                     // fits into the existing group.
1569                     // TODO: This does not work in the case if e.g. the group 'O' starts with
1570                     // an umlaut 'O' -> provide unit-test to document this known issue
1571                     const QChar prevChar(firstChar.unicode() - ushort(1));
1572                     const QChar nextChar(firstChar.unicode() + ushort(1));
1573                     const QString currChar(newFirstChar);
1574                     const bool partOfCurrentGroup = currChar.localeAwareCompare(prevChar) > 0 &&
1575                                                     currChar.localeAwareCompare(nextChar) < 0;
1576                     if (partOfCurrentGroup) {
1577                         continue;
1578                     }
1579                 }
1580                 newGroupValue = i18nc("@title:group", "Others");
1581                 isLetter = false;
1582             }
1583
1584             if (newGroupValue != groupValue) {
1585                 groupValue = newGroupValue;
1586                 groups.append(QPair<int, QVariant>(i, newGroupValue));
1587             }
1588
1589             firstChar = newFirstChar;
1590         }
1591     }
1592     return groups;
1593 }
1594
1595 QList<QPair<int, QVariant> > KFileItemModel::sizeRoleGroups() const
1596 {
1597     Q_ASSERT(!m_itemData.isEmpty());
1598
1599     const int maxIndex = count() - 1;
1600     QList<QPair<int, QVariant> > groups;
1601
1602     QString groupValue;
1603     for (int i = 0; i <= maxIndex; ++i) {
1604         if (isChildItem(i)) {
1605             continue;
1606         }
1607
1608         const KFileItem& item = m_itemData.at(i)->item;
1609         const KIO::filesize_t fileSize = !item.isNull() ? item.size() : ~0U;
1610         QString newGroupValue;
1611         if (!item.isNull() && item.isDir()) {
1612             newGroupValue = i18nc("@title:group Size", "Folders");
1613         } else if (fileSize < 5 * 1024 * 1024) {
1614             newGroupValue = i18nc("@title:group Size", "Small");
1615         } else if (fileSize < 10 * 1024 * 1024) {
1616             newGroupValue = i18nc("@title:group Size", "Medium");
1617         } else {
1618             newGroupValue = i18nc("@title:group Size", "Big");
1619         }
1620
1621         if (newGroupValue != groupValue) {
1622             groupValue = newGroupValue;
1623             groups.append(QPair<int, QVariant>(i, newGroupValue));
1624         }
1625     }
1626
1627     return groups;
1628 }
1629
1630 QList<QPair<int, QVariant> > KFileItemModel::dateRoleGroups() const
1631 {
1632     Q_ASSERT(!m_itemData.isEmpty());
1633
1634     const int maxIndex = count() - 1;
1635     QList<QPair<int, QVariant> > groups;
1636
1637     const QDate currentDate = KDateTime::currentLocalDateTime().date();
1638
1639     int yearForCurrentWeek = 0;
1640     int currentWeek = currentDate.weekNumber(&yearForCurrentWeek);
1641     if (yearForCurrentWeek == currentDate.year() + 1) {
1642         currentWeek = 53;
1643     }
1644
1645     QDate previousModifiedDate;
1646     QString groupValue;
1647     for (int i = 0; i <= maxIndex; ++i) {
1648         if (isChildItem(i)) {
1649             continue;
1650         }
1651
1652         const KDateTime modifiedTime = m_itemData.at(i)->item.time(KFileItem::ModificationTime);
1653         const QDate modifiedDate = modifiedTime.date();
1654         if (modifiedDate == previousModifiedDate) {
1655             // The current item is in the same group as the previous item
1656             continue;
1657         }
1658         previousModifiedDate = modifiedDate;
1659
1660         const int daysDistance = modifiedDate.daysTo(currentDate);
1661
1662         int yearForModifiedWeek = 0;
1663         int modifiedWeek = modifiedDate.weekNumber(&yearForModifiedWeek);
1664         if (yearForModifiedWeek == modifiedDate.year() + 1) {
1665             modifiedWeek = 53;
1666         }
1667
1668         QString newGroupValue;
1669         if (currentDate.year() == modifiedDate.year() && currentDate.month() == modifiedDate.month()) {
1670             if (modifiedWeek > currentWeek) {
1671                 // Usecase: modified date = 2010-01-01, current date = 2010-01-22
1672                 //          modified week = 53,         current week = 3
1673                 modifiedWeek = 0;
1674             }
1675             switch (currentWeek - modifiedWeek) {
1676             case 0:
1677                 switch (daysDistance) {
1678                 case 0:  newGroupValue = i18nc("@title:group Date", "Today"); break;
1679                 case 1:  newGroupValue = i18nc("@title:group Date", "Yesterday"); break;
1680                 default: newGroupValue = modifiedTime.toString(i18nc("@title:group The week day name: %A", "%A"));
1681                 }
1682                 break;
1683             case 1:
1684                 newGroupValue = i18nc("@title:group Date", "Last Week");
1685                 break;
1686             case 2:
1687                 newGroupValue = i18nc("@title:group Date", "Two Weeks Ago");
1688                 break;
1689             case 3:
1690                 newGroupValue = i18nc("@title:group Date", "Three Weeks Ago");
1691                 break;
1692             case 4:
1693             case 5:
1694                 newGroupValue = i18nc("@title:group Date", "Earlier this Month");
1695                 break;
1696             default:
1697                 Q_ASSERT(false);
1698             }
1699         } else {
1700             const QDate lastMonthDate = currentDate.addMonths(-1);
1701             if  (lastMonthDate.year() == modifiedDate.year() && lastMonthDate.month() == modifiedDate.month()) {
1702                 if (daysDistance == 1) {
1703                     newGroupValue = modifiedTime.toString(i18nc("@title:group Date: %B is full month name in current locale, and %Y is full year number", "Yesterday (%B, %Y)"));
1704                 } else if (daysDistance <= 7) {
1705                     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)"));
1706                 } else if (daysDistance <= 7 * 2) {
1707                     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)"));
1708                 } else if (daysDistance <= 7 * 3) {
1709                     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)"));
1710                 } else if (daysDistance <= 7 * 4) {
1711                     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)"));
1712                 } else {
1713                     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"));
1714                 }
1715             } else {
1716                 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"));
1717             }
1718         }
1719
1720         if (newGroupValue != groupValue) {
1721             groupValue = newGroupValue;
1722             groups.append(QPair<int, QVariant>(i, newGroupValue));
1723         }
1724     }
1725
1726     return groups;
1727 }
1728
1729 QList<QPair<int, QVariant> > KFileItemModel::permissionRoleGroups() const
1730 {
1731     Q_ASSERT(!m_itemData.isEmpty());
1732
1733     const int maxIndex = count() - 1;
1734     QList<QPair<int, QVariant> > groups;
1735
1736     QString permissionsString;
1737     QString groupValue;
1738     for (int i = 0; i <= maxIndex; ++i) {
1739         if (isChildItem(i)) {
1740             continue;
1741         }
1742
1743         const ItemData* itemData = m_itemData.at(i);
1744         const QString newPermissionsString = itemData->values.value("permissions").toString();
1745         if (newPermissionsString == permissionsString) {
1746             continue;
1747         }
1748         permissionsString = newPermissionsString;
1749
1750         const QFileInfo info(itemData->item.url().pathOrUrl());
1751
1752         // Set user string
1753         QString user;
1754         if (info.permission(QFile::ReadUser)) {
1755             user = i18nc("@item:intext Access permission, concatenated", "Read, ");
1756         }
1757         if (info.permission(QFile::WriteUser)) {
1758             user += i18nc("@item:intext Access permission, concatenated", "Write, ");
1759         }
1760         if (info.permission(QFile::ExeUser)) {
1761             user += i18nc("@item:intext Access permission, concatenated", "Execute, ");
1762         }
1763         user = user.isEmpty() ? i18nc("@item:intext Access permission, concatenated", "Forbidden") : user.mid(0, user.count() - 2);
1764
1765         // Set group string
1766         QString group;
1767         if (info.permission(QFile::ReadGroup)) {
1768             group = i18nc("@item:intext Access permission, concatenated", "Read, ");
1769         }
1770         if (info.permission(QFile::WriteGroup)) {
1771             group += i18nc("@item:intext Access permission, concatenated", "Write, ");
1772         }
1773         if (info.permission(QFile::ExeGroup)) {
1774             group += i18nc("@item:intext Access permission, concatenated", "Execute, ");
1775         }
1776         group = group.isEmpty() ? i18nc("@item:intext Access permission, concatenated", "Forbidden") : group.mid(0, group.count() - 2);
1777
1778         // Set others string
1779         QString others;
1780         if (info.permission(QFile::ReadOther)) {
1781             others = i18nc("@item:intext Access permission, concatenated", "Read, ");
1782         }
1783         if (info.permission(QFile::WriteOther)) {
1784             others += i18nc("@item:intext Access permission, concatenated", "Write, ");
1785         }
1786         if (info.permission(QFile::ExeOther)) {
1787             others += i18nc("@item:intext Access permission, concatenated", "Execute, ");
1788         }
1789         others = others.isEmpty() ? i18nc("@item:intext Access permission, concatenated", "Forbidden") : others.mid(0, others.count() - 2);
1790
1791         const QString newGroupValue = i18nc("@title:group Files and folders by permissions", "User: %1 | Group: %2 | Others: %3", user, group, others);
1792         if (newGroupValue != groupValue) {
1793             groupValue = newGroupValue;
1794             groups.append(QPair<int, QVariant>(i, newGroupValue));
1795         }
1796     }
1797
1798     return groups;
1799 }
1800
1801 QList<QPair<int, QVariant> > KFileItemModel::ratingRoleGroups() const
1802 {
1803     Q_ASSERT(!m_itemData.isEmpty());
1804
1805     const int maxIndex = count() - 1;
1806     QList<QPair<int, QVariant> > groups;
1807
1808     int groupValue;
1809     for (int i = 0; i <= maxIndex; ++i) {
1810         if (isChildItem(i)) {
1811             continue;
1812         }
1813         const int newGroupValue = m_itemData.at(i)->values.value("rating").toInt();
1814         if (newGroupValue != groupValue) {
1815             groupValue = newGroupValue;
1816             groups.append(QPair<int, QVariant>(i, newGroupValue));
1817         }
1818     }
1819
1820     return groups;
1821 }
1822
1823 QList<QPair<int, QVariant> > KFileItemModel::genericStringRoleGroups(const QByteArray& role) const
1824 {
1825     Q_ASSERT(!m_itemData.isEmpty());
1826
1827     const int maxIndex = count() - 1;
1828     QList<QPair<int, QVariant> > groups;
1829
1830     QString groupValue;
1831     for (int i = 0; i <= maxIndex; ++i) {
1832         if (isChildItem(i)) {
1833             continue;
1834         }
1835         const QString newGroupValue = m_itemData.at(i)->values.value(role).toString();
1836         if (newGroupValue != groupValue) {
1837             groupValue = newGroupValue;
1838             groups.append(QPair<int, QVariant>(i, newGroupValue));
1839         }
1840     }
1841
1842     return groups;
1843 }
1844
1845 #include "kfileitemmodel.moc"