projectmodels.cpp 30.2 KB
Newer Older
hjk's avatar
hjk committed
1
/****************************************************************************
con's avatar
con committed
2
**
3 4
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
con's avatar
con committed
5
**
hjk's avatar
hjk committed
6
** This file is part of Qt Creator.
con's avatar
con committed
7
**
hjk's avatar
hjk committed
8 9 10 11
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
12 13 14
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
15
**
16 17 18 19 20 21 22
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
con's avatar
con committed
23
**
hjk's avatar
hjk committed
24
****************************************************************************/
hjk's avatar
hjk committed
25

con's avatar
con committed
26
#include "projectmodels.h"
hjk's avatar
hjk committed
27 28

#include "project.h"
29
#include "projectnodes.h"
dt's avatar
dt committed
30
#include "projectexplorer.h"
31
#include "projecttree.h"
con's avatar
con committed
32 33

#include <coreplugin/fileiconprovider.h>
34
#include <utils/algorithm.h>
35
#include <utils/dropsupport.h>
hjk's avatar
hjk committed
36

37 38 39
#include <QDebug>
#include <QFileInfo>
#include <QFont>
40
#include <QMimeData>
41
#include <QLoggingCategory>
con's avatar
con committed
42

43 44 45
namespace ProjectExplorer {

using namespace Internal;
con's avatar
con committed
46 47

namespace {
hjk's avatar
hjk committed
48 49

// sorting helper function
dt's avatar
dt committed
50

hjk's avatar
hjk committed
51 52 53 54 55 56 57 58
bool sortNodes(Node *n1, Node *n2)
{
    // Ordering is: project files, project, folder, file

    const NodeType n1Type = n1->nodeType();
    const NodeType n2Type = n2->nodeType();

    // project files
59 60
    FileNode *file1 = n1->asFileNode();
    FileNode *file2 = n2->asFileNode();
61 62
    if (file1 && file1->fileType() == FileType::Project) {
        if (file2 && file2->fileType() == FileType::Project) {
63 64
            const QString fileName1 = file1->filePath().fileName();
            const QString fileName2 = file2->filePath().fileName();
hjk's avatar
hjk committed
65

66
            int result = caseFriendlyCompare(fileName1, fileName2);
dt's avatar
dt committed
67
            if (result != 0)
dt's avatar
dt committed
68
                return result < 0;
hjk's avatar
hjk committed
69 70
            else
                return file1 < file2;
con's avatar
con committed
71
        } else {
hjk's avatar
hjk committed
72 73 74
            return true; // project file is before everything else
        }
    } else {
75
        if (file2 && file2->fileType() == FileType::Project)
hjk's avatar
hjk committed
76 77
            return false;
    }
con's avatar
con committed
78

hjk's avatar
hjk committed
79
    // projects
80 81
    if (n1Type == NodeType::Project) {
        if (n2Type == NodeType::Project) {
82 83
            auto project1 = static_cast<ProjectNode*>(n1);
            auto project2 = static_cast<ProjectNode*>(n2);
con's avatar
con committed
84

85
            int result = caseFriendlyCompare(project1->displayName(), project2->displayName());
dt's avatar
dt committed
86
            if (result != 0)
dt's avatar
dt committed
87
                return result < 0;
88

89 90
            result = caseFriendlyCompare(project1->filePath().toString(),
                                         project2->filePath().toString());
91 92 93
            if (result != 0)
                return result < 0;
            return project1 < project2; // sort by pointer value
hjk's avatar
hjk committed
94 95 96 97
        } else {
           return true; // project is before folder & file
       }
    }
98
    if (n2Type == NodeType::Project)
hjk's avatar
hjk committed
99
        return false;
con's avatar
con committed
100

101 102
    if (n1Type == NodeType::VirtualFolder) {
        if (n2Type == NodeType::VirtualFolder) {
103 104
            auto folder1 = static_cast<VirtualFolderNode *>(n1);
            auto folder2 = static_cast<VirtualFolderNode *>(n2);
105 106 107 108 109

            if (folder1->priority() > folder2->priority())
                return true;
            if (folder1->priority() < folder2->priority())
                return false;
110 111
            int result = caseFriendlyCompare(folder1->filePath().toString(),
                                             folder2->filePath().toString());
112 113 114 115 116 117 118 119 120
            if (result != 0)
                return result < 0;
            else
                return folder1 < folder2;
        } else {
            return true; // virtual folder is before folder
        }
    }

121
    if (n2Type == NodeType::VirtualFolder)
122 123 124
        return false;


125 126
    if (n1Type == NodeType::Folder) {
        if (n2Type == NodeType::Folder) {
127 128
            auto folder1 = static_cast<FolderNode*>(n1);
            auto folder2 = static_cast<FolderNode*>(n2);
con's avatar
con committed
129

130 131
            int result = caseFriendlyCompare(folder1->filePath().toString(),
                                             folder2->filePath().toString());
dt's avatar
dt committed
132
            if (result != 0)
dt's avatar
dt committed
133
                return result < 0;
hjk's avatar
hjk committed
134 135 136 137
            else
                return folder1 < folder2;
        } else {
            return true; // folder is before file
con's avatar
con committed
138
        }
hjk's avatar
hjk committed
139
    }
140
    if (n2Type == NodeType::Folder)
hjk's avatar
hjk committed
141
        return false;
con's avatar
con committed
142

hjk's avatar
hjk committed
143
    // must be file nodes
144 145 146
    int result = caseFriendlyCompare(n1->displayName(), n2->displayName());
    if (result != 0)
        return result < 0;
147

148 149
    const QString filePath1 = n1->filePath().toString();
    const QString filePath2 = n2->filePath().toString();
con's avatar
con committed
150

151 152
    const QString fileName1 = n1->filePath().fileName();
    const QString fileName2 = n2->filePath().fileName();
con's avatar
con committed
153

154 155 156 157 158 159 160
    result = caseFriendlyCompare(fileName1, fileName2);
    if (result != 0) {
        return result < 0; // sort by filename
    } else {
        result = caseFriendlyCompare(filePath1, filePath2);
        if (result != 0)
            return result < 0; // sort by filepath
161

162 163 164
        if (n1->line() != n2->line())
            return n1->line() < n2->line(); // sort by line numbers
        return n1 < n2; // sort by pointer value
con's avatar
con committed
165 166 167
    }
}

hjk's avatar
hjk committed
168 169
} // namespace anon

170 171
FlatModel::FlatModel(SessionNode *rootNode, QObject *parent) : QAbstractItemModel(parent),
    m_rootNode(rootNode)
con's avatar
con committed
172
{
173
    ProjectTree *tree = ProjectTree::instance();
con's avatar
con committed
174

175 176
    connect(tree, &ProjectTree::aboutToChangeShowInSimpleTree,
            this, &FlatModel::aboutToShowInSimpleTreeChanged);
177

178 179
    connect(tree, &ProjectTree::showInSimpleTreeChanged,
            this, &FlatModel::showInSimpleTreeChanged);
180

181 182 183 184
    connect(tree, &ProjectTree::foldersAboutToBeAdded,
            this, &FlatModel::foldersAboutToBeAdded);
    connect(tree, &ProjectTree::foldersAdded,
            this, &FlatModel::foldersAdded);
con's avatar
con committed
185

186 187 188 189
    connect(tree, &ProjectTree::foldersAboutToBeRemoved,
            this, &FlatModel::foldersAboutToBeRemoved);
    connect(tree, &ProjectTree::foldersRemoved,
            this, &FlatModel::foldersRemoved);
con's avatar
con committed
190

191 192 193 194
    connect(tree, &ProjectTree::filesAboutToBeAdded,
            this, &FlatModel::filesAboutToBeAdded);
    connect(tree, &ProjectTree::filesAdded,
            this, &FlatModel::filesAdded);
con's avatar
con committed
195

196 197 198 199
    connect(tree, &ProjectTree::filesAboutToBeRemoved,
            this, &FlatModel::filesAboutToBeRemoved);
    connect(tree, &ProjectTree::filesRemoved,
            this, &FlatModel::filesRemoved);
200

201 202 203 204
    connect(tree, &ProjectTree::nodeSortKeyAboutToChange,
            this, &FlatModel::nodeSortKeyAboutToChange);
    connect(tree, &ProjectTree::nodeSortKeyChanged,
            this, &FlatModel::nodeSortKeyChanged);
205

206 207
    connect(tree, &ProjectTree::nodeUpdated,
            this, &FlatModel::nodeUpdated);
con's avatar
con committed
208 209 210 211 212 213 214 215
}

QModelIndex FlatModel::index(int row, int column, const QModelIndex &parent) const
{
    QModelIndex result;
    if (!parent.isValid() && row == 0 && column == 0) { // session
        result = createIndex(0, 0, m_rootNode);
    } else if (parent.isValid() && column == 0) {
216
        FolderNode *parentNode = nodeForIndex(parent)->asFolderNode();
dt's avatar
dt committed
217
        Q_ASSERT(parentNode);
con's avatar
con committed
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235
        QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(parentNode);
        if (it == m_childNodes.constEnd()) {
            fetchMore(parentNode);
            it = m_childNodes.constFind(parentNode);
        }

        if (row < it.value().size())
            result = createIndex(row, 0, it.value().at(row));
    }
//    qDebug() << "index of " << row << column << parent.data(Project::FilePathRole) << " is " << result.data(Project::FilePathRole);
    return result;
}

QModelIndex FlatModel::parent(const QModelIndex &idx) const
{
    QModelIndex parentIndex;
    if (Node *node = nodeForIndex(idx)) {
        FolderNode *parentNode = visibleFolderNode(node->parentFolderNode());
236 237
        if (parentNode)
            return indexForNode(parentNode);
con's avatar
con committed
238 239 240 241 242 243 244 245 246
    }
    return parentIndex;
}

QVariant FlatModel::data(const QModelIndex &index, int role) const
{
    QVariant result;

    if (Node *node = nodeForIndex(index)) {
247
        FolderNode *folderNode = node->asFolderNode();
con's avatar
con committed
248
        switch (role) {
249 250 251
        case Qt::DisplayRole: {
            QString name = node->displayName();

252
            if (node->nodeType() == NodeType::Project
253
                    && node->parentFolderNode()
254
                    && node->parentFolderNode()->nodeType() == NodeType::Session) {
255
                const QString vcsTopic = static_cast<ProjectNode *>(node)->vcsTopic();
256 257

                if (!vcsTopic.isEmpty())
258
                    name += QLatin1String(" [") + vcsTopic + QLatin1Char(']');
259 260 261 262 263
            }

            result = name;
            break;
        }
con's avatar
con committed
264
        case Qt::EditRole: {
265
            result = node->filePath().fileName();
con's avatar
con committed
266 267 268
            break;
        }
        case Qt::ToolTipRole: {
269
            result = node->tooltip();
con's avatar
con committed
270 271 272 273 274 275
            break;
        }
        case Qt::DecorationRole: {
            if (folderNode)
                result = folderNode->icon();
            else
276
                result = Core::FileIconProvider::icon(node->filePath().toString());
con's avatar
con committed
277 278 279 280 281 282 283 284 285
            break;
        }
        case Qt::FontRole: {
            QFont font;
            if (node == m_startupProject)
                font.setBold(true);
            result = font;
            break;
        }
286
        case Project::FilePathRole: {
287
            result = node->filePath().toString();
con's avatar
con committed
288 289
            break;
        }
290
        case Project::EnabledRole: {
291 292 293
            result = node->isEnabled();
            break;
        }
con's avatar
con committed
294 295 296 297 298 299
        }
    }

    return result;
}

dt's avatar
dt committed
300 301 302 303 304 305 306
Qt::ItemFlags FlatModel::flags(const QModelIndex &index) const
{
    if (!index.isValid())
        return 0;
    // We claim that everything is editable
    // That's slightly wrong
    // We control the only view, and that one does the checks
307
    Qt::ItemFlags f = Qt::ItemIsSelectable|Qt::ItemIsEnabled|Qt::ItemIsDragEnabled;
308
    if (Node *node = nodeForIndex(index)) {
309 310
        if (node == m_rootNode)
            return 0; // no flags for session node...
311
        if (!node->asProjectNode()) {
312
            // either folder or file node
313
            if (node->supportedActions(node).contains(Rename))
314 315 316 317
                f = f | Qt::ItemIsEditable;
        }
    }
    return f;
dt's avatar
dt committed
318 319 320 321 322 323 324 325 326
}

bool FlatModel::setData(const QModelIndex &index, const QVariant &value, int role)
{
    if (!index.isValid())
        return false;
    if (role != Qt::EditRole)
        return false;

327 328
    Node *node = nodeForIndex(index);

329
    Utils::FileName orgFilePath = node->filePath();
330
    Utils::FileName newFilePath = orgFilePath.parentDir().appendPath(value.toString());
331

332
    ProjectExplorerPlugin::renameFile(node, newFilePath.toString());
333
    emit renamed(orgFilePath, newFilePath);
dt's avatar
dt committed
334 335 336
    return true;
}

con's avatar
con committed
337 338 339 340 341 342
int FlatModel::rowCount(const QModelIndex &parent) const
{
    int rows = 0;
    if (!parent.isValid()) {
        rows = 1;
    } else {
343
        FolderNode *folderNode = nodeForIndex(parent)->asFolderNode();
con's avatar
con committed
344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359
        if (folderNode && m_childNodes.contains(folderNode))
            rows = m_childNodes.value(folderNode).size();
    }
    return rows;
}

int FlatModel::columnCount(const QModelIndex &/*parent*/) const
{
    return 1;
}

bool FlatModel::hasChildren(const QModelIndex &parent) const
{
    if (!parent.isValid())
        return true;

360
    FolderNode *folderNode = nodeForIndex(parent)->asFolderNode();
con's avatar
con committed
361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376
    if (!folderNode)
        return false;

    QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(folderNode);
    if (it == m_childNodes.constEnd()) {
        fetchMore(folderNode);
        it = m_childNodes.constFind(folderNode);
    }
    return !it.value().isEmpty();
}

bool FlatModel::canFetchMore(const QModelIndex & parent) const
{
    if (!parent.isValid()) {
        return false;
    } else {
377
        if (FolderNode *folderNode = nodeForIndex(parent)->asFolderNode())
con's avatar
con committed
378 379 380 381 382 383 384 385
            return !m_childNodes.contains(folderNode);
        else
            return false;
    }
}

void FlatModel::recursiveAddFolderNodes(FolderNode *startNode, QList<Node *> *list, const QSet<Node *> &blackList) const
{
386
    foreach (FolderNode *folderNode, startNode->folderNodes()) {
con's avatar
con committed
387 388 389 390 391 392 393 394 395 396 397
        if (folderNode && !blackList.contains(folderNode))
            recursiveAddFolderNodesImpl(folderNode, list, blackList);
    }
}

void FlatModel::recursiveAddFolderNodesImpl(FolderNode *startNode, QList<Node *> *list, const QSet<Node *> &blackList) const
{
    if (!filter(startNode)) {
        if (!blackList.contains(startNode))
            list->append(startNode);
    } else {
398
        foreach (FolderNode *folderNode, startNode->folderNodes()) {
con's avatar
con committed
399 400 401 402 403 404 405 406
            if (folderNode && !blackList.contains(folderNode))
                recursiveAddFolderNodesImpl(folderNode, list, blackList);
        }
    }
}

void FlatModel::recursiveAddFileNodes(FolderNode *startNode, QList<Node *> *list, const QSet<Node *> &blackList) const
{
407
    foreach (FolderNode *subFolderNode, startNode->folderNodes()) {
con's avatar
con committed
408 409 410 411 412 413 414 415 416 417 418
        if (!blackList.contains(subFolderNode))
            recursiveAddFileNodes(subFolderNode, list, blackList);
    }
    foreach (Node *node, startNode->fileNodes()) {
        if (!blackList.contains(node) && !filter(node))
            list->append(node);
    }
}

QList<Node*> FlatModel::childNodes(FolderNode *parentNode, const QSet<Node*> &blackList) const
{
419
    qCDebug(logger()) << "    FlatModel::childNodes for " << parentNode->filePath();
con's avatar
con committed
420 421
    QList<Node*> nodeList;

422
    if (parentNode->nodeType() == NodeType::Session) {
423
        auto sessionNode = static_cast<SessionNode*>(parentNode);
con's avatar
con committed
424 425 426 427 428 429 430 431 432
        QList<ProjectNode*> projectList = sessionNode->projectNodes();
        for (int i = 0; i < projectList.size(); ++i) {
            if (!blackList.contains(projectList.at(i)))
                nodeList << projectList.at(i);
        }
    } else {
        recursiveAddFolderNodes(parentNode, &nodeList, blackList);
        recursiveAddFileNodes(parentNode, &nodeList, blackList + nodeList.toSet());
    }
433
    Utils::sort(nodeList, sortNodes);
434
    qCDebug(logger()) << "      found" << nodeList.size() << "nodes";
con's avatar
con committed
435 436 437 438 439
    return nodeList;
}

void FlatModel::fetchMore(FolderNode *folderNode) const
{
dt's avatar
dt committed
440 441
    Q_ASSERT(folderNode);
    Q_ASSERT(!m_childNodes.contains(folderNode));
con's avatar
con committed
442 443 444 445 446 447 448

    QList<Node*> nodeList = childNodes(folderNode);
    m_childNodes.insert(folderNode, nodeList);
}

void FlatModel::fetchMore(const QModelIndex &parent)
{
449
    FolderNode *folderNode = nodeForIndex(parent)->asFolderNode();
dt's avatar
dt committed
450
    Q_ASSERT(folderNode);
con's avatar
con committed
451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469

    fetchMore(folderNode);
}

void FlatModel::setStartupProject(ProjectNode *projectNode)
{
    if (m_startupProject != projectNode) {
        QModelIndex oldIndex = (m_startupProject ? indexForNode(m_startupProject) : QModelIndex());
        QModelIndex newIndex = (projectNode ? indexForNode(projectNode) : QModelIndex());
        m_startupProject = projectNode;
        if (oldIndex.isValid())
            emit dataChanged(oldIndex, oldIndex);
        if (newIndex.isValid())
            emit dataChanged(newIndex, newIndex);
    }
}

void FlatModel::reset()
{
470
    beginResetModel();
con's avatar
con committed
471
    m_childNodes.clear();
472
    endResetModel();
con's avatar
con committed
473 474
}

475 476 477 478 479
Qt::DropActions FlatModel::supportedDragActions() const
{
    return Qt::MoveAction;
}

480 481
QStringList FlatModel::mimeTypes() const
{
482
    return Utils::DropSupport::mimeTypesForFilePaths();
483 484 485 486
}

QMimeData *FlatModel::mimeData(const QModelIndexList &indexes) const
{
487
    auto data = new Utils::DropMimeData;
488 489
    foreach (const QModelIndex &index, indexes) {
        Node *node = nodeForIndex(index);
490
        if (node->asFileNode())
491
            data->addFile(node->filePath().toString());
492
        data->addValue(QVariant::fromValue(node));
493
    }
494
    return data;
495 496
}

497
QModelIndex FlatModel::indexForNode(const Node *node_) const
con's avatar
con committed
498 499 500 501
{
    // We assume that we are only called for nodes that are represented

    // we use non-const pointers internally
502
    auto node = const_cast<Node*>(node_);
con's avatar
con committed
503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526
    if (!node)
        return QModelIndex();

    if (node == m_rootNode)
        return createIndex(0, 0, m_rootNode);

    FolderNode *parentNode = visibleFolderNode(node->parentFolderNode());

    // Do we have the parent mapped?
    QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(parentNode);
    if (it == m_childNodes.constEnd()) {
        fetchMore(parentNode);
        it = m_childNodes.constFind(parentNode);
    }
    if (it != m_childNodes.constEnd()) {
        const int row = it.value().indexOf(node);
        if (row != -1)
            return createIndex(row, 0, node);
    }
    return QModelIndex();
}

void FlatModel::setProjectFilterEnabled(bool filter)
{
527 528
    if (filter == m_filterProjects)
        return;
con's avatar
con committed
529 530 531 532 533 534 535 536 537 538
    m_filterProjects = filter;
    reset();
}

void FlatModel::setGeneratedFilesFilterEnabled(bool filter)
{
    m_filterGeneratedFiles = filter;
    reset();
}

539 540 541 542 543 544 545 546 547 548
bool FlatModel::projectFilterEnabled()
{
    return m_filterProjects;
}

bool FlatModel::generatedFilesFilterEnabled()
{
    return m_filterGeneratedFiles;
}

con's avatar
con committed
549 550 551 552
Node *FlatModel::nodeForIndex(const QModelIndex &index) const
{
    if (index.isValid())
        return (Node*)index.internalPointer();
553
    return nullptr;
con's avatar
con committed
554 555 556 557 558 559 560 561 562 563
}

/*
  Returns the first folder node in the ancestors
  for the given node that is not filtered
  out by the Flat Model.
*/
FolderNode *FlatModel::visibleFolderNode(FolderNode *node) const
{
    if (!node)
564
        return nullptr;
con's avatar
con committed
565 566 567 568 569 570 571

    for (FolderNode *folderNode = node;
         folderNode;
         folderNode = folderNode->parentFolderNode()) {
        if (!filter(folderNode))
            return folderNode;
    }
572
    return nullptr;
con's avatar
con committed
573 574 575 576 577
}

bool FlatModel::filter(Node *node) const
{
    bool isHidden = false;
578
    if (FolderNode *folderNode = node->asFolderNode()) {
579
        if (m_filterProjects)
580
            isHidden = !folderNode->showInSimpleTree();
581
    } else if (FileNode *fileNode = node->asFileNode()) {
con's avatar
con committed
582 583 584 585 586 587
        if (m_filterGeneratedFiles)
            isHidden = fileNode->isGenerated();
    }
    return isHidden;
}

588 589 590 591 592 593
const QLoggingCategory &FlatModel::logger()
{
    static QLoggingCategory logger("qtc.projectexplorer.flatmodel");
    return logger;
}

594 595 596 597 598 599 600 601 602 603
bool isSorted(const QList<Node *> &nodes)
{
    int size = nodes.size();
    for (int i = 0; i < size -1; ++i) {
        if (!sortNodes(nodes.at(i), nodes.at(i+1)))
            return false;
    }
    return true;
}

con's avatar
con committed
604 605 606
/// slots and all the fun
void FlatModel::added(FolderNode* parentNode, const QList<Node*> &newNodeList)
{
607
    qCDebug(logger()) << "FlatModel::added" << parentNode->filePath() << newNodeList.size() << "nodes";
con's avatar
con committed
608 609
    QModelIndex parentIndex = indexForNode(parentNode);
    // Old  list
610 611 612 613 614 615

    if (newNodeList.isEmpty()) {
        qCDebug(logger()) << "  newNodeList empty";
        return;
    }

con's avatar
con committed
616
    QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(parentNode);
617 618 619 620 621 622 623 624 625
    if (it == m_childNodes.constEnd()) {
        if (!parentIndex.isValid()) {
            qCDebug(logger()) << "  parent not mapped returning";
            return;
        }
        qCDebug(logger()) << "  updated m_childNodes";
        beginInsertRows(parentIndex, 0, newNodeList.size() - 1);
        m_childNodes.insert(parentNode, newNodeList);
        endInsertRows();
con's avatar
con committed
626
        return;
627
    }
con's avatar
con committed
628 629 630 631 632 633
    QList<Node *> oldNodeList = it.value();

    // Compare lists and emit signals, and modify m_childNodes on the fly
    QList<Node *>::const_iterator oldIter = oldNodeList.constBegin();
    QList<Node *>::const_iterator newIter = newNodeList.constBegin();

634 635 636 637 638 639 640 641 642
    Q_ASSERT(isSorted(oldNodeList));
    Q_ASSERT(isSorted(newNodeList));

    QSet<Node *> emptyDifference;
    emptyDifference = oldNodeList.toSet();
    emptyDifference.subtract(newNodeList.toSet());
    if (!emptyDifference.isEmpty()) {
        // This should not happen...
        qDebug() << "FlatModel::added, old Node list should be subset of newNode list, found files in old list which were not part of new list";
643 644
        foreach (Node *n, emptyDifference)
            qDebug()<<n->filePath();
645 646 647
        Q_ASSERT(false);
    }

con's avatar
con committed
648 649 650 651 652 653 654 655 656
    // optimization, check for old list is empty
    if (oldIter == oldNodeList.constEnd()) {
        // New Node List is empty, nothing added which intrest us
        if (newIter == newNodeList.constEnd())
            return;
        // So all we need to do is easy
        beginInsertRows(parentIndex, 0, newNodeList.size() - 1);
        m_childNodes.insert(parentNode, newNodeList);
        endInsertRows();
657
        qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
658 659 660
        return;
    }

hjk's avatar
hjk committed
661
    while (true) {
con's avatar
con committed
662
        // Skip all that are the same
hjk's avatar
hjk committed
663
        while (*oldIter == *newIter) {
con's avatar
con committed
664 665 666 667 668 669 670 671 672 673
            ++oldIter;
            ++newIter;
            if (oldIter == oldNodeList.constEnd()) {
                // At end of oldNodeList, sweep up rest of newNodeList
                QList<Node *>::const_iterator startOfBlock = newIter;
                newIter = newNodeList.constEnd();
                int pos = oldIter - oldNodeList.constBegin();
                int count = newIter - startOfBlock;
                if (count > 0) {
                    beginInsertRows(parentIndex, pos, pos+count-1);
hjk's avatar
hjk committed
674
                    while (startOfBlock != newIter) {
con's avatar
con committed
675 676 677 678 679 680 681 682 683 684 685 686
                        oldNodeList.insert(pos, *startOfBlock);
                        ++pos;
                        ++startOfBlock;
                    }
                    m_childNodes.insert(parentNode, oldNodeList);
                    endInsertRows();
                }
                return; // Done with the lists, leave the function
            }
        }

        QList<Node *>::const_iterator startOfBlock = newIter;
hjk's avatar
hjk committed
687
        while (*oldIter != *newIter)
con's avatar
con committed
688 689 690 691 692 693 694 695
            ++newIter;
        // startOfBlock is the first that was diffrent
        // newIter points to the new position of oldIter
        // newIter - startOfBlock is number of new items
        // oldIter is the position where those are...
        int pos = oldIter - oldNodeList.constBegin();
        int count = newIter - startOfBlock;
        beginInsertRows(parentIndex, pos, pos + count - 1);
hjk's avatar
hjk committed
696
        while (startOfBlock != newIter) {
con's avatar
con committed
697 698 699 700 701 702 703 704
            oldNodeList.insert(pos, *startOfBlock);
            ++pos;
            ++startOfBlock;
        }
        m_childNodes.insert(parentNode, oldNodeList);
        endInsertRows();
        oldIter = oldNodeList.constBegin() + pos;
    }
705
    qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
706 707 708 709
}

void FlatModel::removed(FolderNode* parentNode, const QList<Node*> &newNodeList)
{
710
    qCDebug(logger()) << "FlatModel::removed" << parentNode->filePath() << newNodeList.size() << "nodes";
con's avatar
con committed
711 712 713
    QModelIndex parentIndex = indexForNode(parentNode);
    // Old  list
    QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(parentNode);
714 715
    if (it == m_childNodes.constEnd()) {
        qCDebug(logger()) << "  unmapped node";
con's avatar
con committed
716
        return;
717
    }
718

con's avatar
con committed
719 720 721 722 723
    QList<Node *> oldNodeList = it.value();
    // Compare lists and emit signals, and modify m_childNodes on the fly
    QList<Node *>::const_iterator oldIter = oldNodeList.constBegin();
    QList<Node *>::const_iterator newIter = newNodeList.constBegin();

724 725 726 727 728 729 730 731
    Q_ASSERT(isSorted(newNodeList));

    QSet<Node *> emptyDifference;
    emptyDifference = newNodeList.toSet();
    emptyDifference.subtract(oldNodeList.toSet());
    if (!emptyDifference.isEmpty()) {
        // This should not happen...
        qDebug() << "FlatModel::removed, new Node list should be subset of oldNode list, found files in new list which were not part of old list";
732 733
        foreach (Node *n, emptyDifference)
            qDebug()<<n->filePath();
734 735 736
        Q_ASSERT(false);
    }

con's avatar
con committed
737 738 739 740 741 742 743 744 745
    // optimization, check for new list is empty
    if (newIter == newNodeList.constEnd()) {
        // New Node List is empty, everything removed
        if (oldIter == oldNodeList.constEnd())
            return;
        // So all we need to do is easy
        beginRemoveRows(parentIndex, 0, oldNodeList.size() - 1);
        m_childNodes.insert(parentNode, newNodeList);
        endRemoveRows();
746
        qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
747 748 749
        return;
    }

hjk's avatar
hjk committed
750
    while (true) {
con's avatar
con committed
751
        // Skip all that are the same
hjk's avatar
hjk committed
752
        while (*oldIter == *newIter) {
con's avatar
con committed
753 754 755 756 757 758 759 760 761 762
            ++oldIter;
            ++newIter;
            if (newIter == newNodeList.constEnd()) {
                // At end of newNodeList, sweep up rest of oldNodeList
                QList<Node *>::const_iterator startOfBlock = oldIter;
                oldIter = oldNodeList.constEnd();
                int pos = startOfBlock - oldNodeList.constBegin();
                int count = oldIter - startOfBlock;
                if (count > 0) {
                    beginRemoveRows(parentIndex, pos, pos+count-1);
hjk's avatar
hjk committed
763
                    while (startOfBlock != oldIter) {
con's avatar
con committed
764 765 766 767 768 769 770 771 772 773 774 775
                        ++startOfBlock;
                        oldNodeList.removeAt(pos);
                    }

                    m_childNodes.insert(parentNode, oldNodeList);
                    endRemoveRows();
                }
                return; // Done with the lists, leave the function
            }
        }

        QList<Node *>::const_iterator startOfBlock = oldIter;
hjk's avatar
hjk committed
776
        while (*oldIter != *newIter)
con's avatar
con committed
777 778 779 780 781 782 783 784
            ++oldIter;
        // startOfBlock is the first that was diffrent
        // oldIter points to the new position of newIter
        // oldIter - startOfBlock is number of new items
        // newIter is the position where those are...
        int pos = startOfBlock - oldNodeList.constBegin();
        int count = oldIter - startOfBlock;
        beginRemoveRows(parentIndex, pos, pos + count - 1);
hjk's avatar
hjk committed
785
        while (startOfBlock != oldIter) {
con's avatar
con committed
786 787 788 789 790 791 792
            ++startOfBlock;
            oldNodeList.removeAt(pos);
        }
        m_childNodes.insert(parentNode, oldNodeList);
        endRemoveRows();
        oldIter = oldNodeList.constBegin() + pos;
    }
793
    qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
794 795
}

796
void FlatModel::aboutToShowInSimpleTreeChanged(FolderNode* node)
797 798 799 800 801 802 803 804 805 806
{
    if (!m_filterProjects)
        return;
    FolderNode *folder = visibleFolderNode(node->parentFolderNode());
    QList<Node *> newNodeList = childNodes(folder, QSet<Node *>() << node);
    removed(folder, newNodeList);

    QList<Node *> staleFolders;
    recursiveAddFolderNodesImpl(node, &staleFolders);
    foreach (Node *n, staleFolders)
807
        if (FolderNode *fn = n->asFolderNode())
808 809 810
            m_childNodes.remove(fn);
}

811
void FlatModel::showInSimpleTreeChanged(FolderNode *node)
812 813 814 815 816 817 818 819 820
{
    if (!m_filterProjects)
        return;
    // we are only interested if we filter
    FolderNode *folder = visibleFolderNode(node->parentFolderNode());
    QList<Node *> newNodeList = childNodes(folder);
    added(folder, newNodeList);
}

con's avatar
con committed
821 822
void FlatModel::foldersAboutToBeAdded(FolderNode *parentFolder, const QList<FolderNode*> &newFolders)
{
823
    qCDebug(logger()) << "FlatModel::foldersAboutToBeAdded";
con's avatar
con committed
824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841
    Q_UNUSED(newFolders)
    m_parentFolderForChange = parentFolder;
}

void FlatModel::foldersAdded()
{
    // First found out what the folder is that we are adding the files to
    FolderNode *folderNode = visibleFolderNode(m_parentFolderForChange);

    // Now get the new list for that folder
    QList<Node *> newNodeList = childNodes(folderNode);

    added(folderNode, newNodeList);
}

void FlatModel::foldersAboutToBeRemoved(FolderNode *parentFolder, const QList<FolderNode*> &staleFolders)
{
    QSet<Node *> blackList;
hjk's avatar
hjk committed
842
    foreach (FolderNode *node, staleFolders)
con's avatar
con committed
843 844 845 846 847
        blackList.insert(node);

    FolderNode *folderNode = visibleFolderNode(parentFolder);
    QList<Node *> newNodeList = childNodes(folderNode, blackList);

848
    removed(folderNode, newNodeList);
con's avatar
con committed
849 850 851 852 853
    removeFromCache(staleFolders);
}

void FlatModel::removeFromCache(QList<FolderNode *> list)
{
hjk's avatar
hjk committed
854
    foreach (FolderNode *fn, list) {
855
        removeFromCache(fn->folderNodes());
con's avatar
con committed
856 857 858 859
        m_childNodes.remove(fn);
    }
}

860 861
void FlatModel::changedSortKey(FolderNode *folderNode, Node *node)
{
862 863 864
    if (!m_childNodes.contains(folderNode))
        return; // The directory was not yet mapped, so there is no need to sort it.

865 866 867 868
    QList<Node *> nodes = m_childNodes.value(folderNode);
    int oldIndex = nodes.indexOf(node);

    nodes.removeAt(oldIndex);
869
    QList<Node *>::iterator newPosIt = std::lower_bound(nodes.begin(), nodes.end(), node, sortNodes);
870 871 872 873 874 875 876 877 878 879 880 881 882 883 884
    int newIndex = newPosIt - nodes.begin();

    if (newIndex == oldIndex)
        return;

    nodes.insert(newPosIt, node);

    QModelIndex parentIndex = indexForNode(folderNode);
    if (newIndex > oldIndex)
        ++newIndex; // see QAbstractItemModel::beginMoveRows
    beginMoveRows(parentIndex, oldIndex, oldIndex, parentIndex, newIndex);
    m_childNodes[folderNode] = nodes;
    endMoveRows();
}

con's avatar
con committed
885 886 887 888 889 890 891
void FlatModel::foldersRemoved()
{
    // Do nothing
}

void FlatModel::filesAboutToBeAdded(FolderNode *folder, const QList<FileNode*> &newFiles)
{
892
    qCDebug(logger()) << "FlatModel::filesAboutToBeAdded";
con's avatar
con committed
893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912
    Q_UNUSED(newFiles)
    m_parentFolderForChange = folder;
}

void FlatModel::filesAdded()
{
    // First find out what the folder is that we are adding the files to
    FolderNode *folderNode = visibleFolderNode(m_parentFolderForChange);

    // Now get the new List for that folder
    QList<Node *> newNodeList = childNodes(folderNode);
    added(folderNode, newNodeList);
}

void FlatModel::filesAboutToBeRemoved(FolderNode *folder, const QList<FileNode*> &staleFiles)
{
    // First found out what the folder (that is the project) is that we are adding the files to
    FolderNode *folderNode = visibleFolderNode(folder);

    QSet<Node *> blackList;
913
    foreach (Node *node, staleFiles)
con's avatar
con committed
914 915 916 917 918 919 920 921 922 923 924
        blackList.insert(node);

    // Now get the new List for that folder
    QList<Node *> newNodeList = childNodes(folderNode, blackList);
    removed(folderNode, newNodeList);
}

void FlatModel::filesRemoved()
{
    // Do nothing
}
925

926 927 928 929 930 931 932 933 934 935 936
void FlatModel::nodeSortKeyAboutToChange(Node *node)
{
    m_nodeForSortKeyChange = node;
}

void FlatModel::nodeSortKeyChanged()
{
    FolderNode *folderNode = visibleFolderNode(m_nodeForSortKeyChange->parentFolderNode());
    changedSortKey(folderNode, m_nodeForSortKeyChange);
}

937 938 939 940 941 942
void FlatModel::nodeUpdated(Node *node)
{
    QModelIndex idx = indexForNode(node);
    emit dataChanged(idx, idx);
}

943 944 945 946 947 948 949 950 951 952 953
namespace Internal {

int caseFriendlyCompare(const QString &a, const QString &b)
{
    int result = a.compare(b, Qt::CaseInsensitive);
    if (result != 0)
        return result;
    return a.compare(b, Qt::CaseSensitive);
}

}
954 955

} // namespace ProjectExplorer
956