projectmodels.cpp 30.7 KB
Newer Older
hjk's avatar
hjk committed
1
/****************************************************************************
con's avatar
con committed
2
**
Eike Ziller's avatar
Eike Ziller committed
3 4
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://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
Eike Ziller's avatar
Eike Ziller committed
12 13
** a written agreement between you and The Qt Company.  For licensing terms and
** conditions see http://www.qt.io/terms-conditions.  For further information
Eike Ziller's avatar
Eike Ziller committed
14
** use the contact form at http://www.qt.io/contact-us.
15
**
16
** GNU Lesser General Public License Usage
hjk's avatar
hjk committed
17
** Alternatively, this file may be used under the terms of the GNU Lesser
Eike Ziller's avatar
Eike Ziller committed
18 19 20 21 22 23
** General Public License version 2.1 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file.  Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
hjk's avatar
hjk committed
24
**
Eike Ziller's avatar
Eike Ziller committed
25 26
** In addition, as a special exception, The Qt Company gives you certain additional
** rights.  These rights are described in The Qt Company LGPL Exception
con's avatar
con committed
27 28
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
hjk's avatar
hjk committed
29
****************************************************************************/
hjk's avatar
hjk committed
30

con's avatar
con committed
31
#include "projectmodels.h"
hjk's avatar
hjk committed
32 33

#include "project.h"
34
#include "projectnodes.h"
dt's avatar
dt committed
35
#include "projectexplorer.h"
36
#include "projecttree.h"
con's avatar
con committed
37 38

#include <coreplugin/fileiconprovider.h>
39
#include <utils/algorithm.h>
hjk's avatar
hjk committed
40

41 42 43
#include <QDebug>
#include <QFileInfo>
#include <QFont>
44
#include <QMimeData>
45
#include <QLoggingCategory>
con's avatar
con committed
46

47 48 49
namespace ProjectExplorer {

using namespace Internal;
con's avatar
con committed
50 51

namespace {
hjk's avatar
hjk committed
52 53

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

hjk's avatar
hjk committed
55 56 57 58 59 60 61 62
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
63 64
    FileNode *file1 = n1->asFileNode();
    FileNode *file2 = n2->asFileNode();
hjk's avatar
hjk committed
65 66
    if (file1 && file1->fileType() == ProjectFileType) {
        if (file2 && file2->fileType() == ProjectFileType) {
67 68
            const QString fileName1 = file1->path().fileName();
            const QString fileName2 = file2->path().fileName();
hjk's avatar
hjk committed
69

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

hjk's avatar
hjk committed
83 84 85 86 87
    // projects
    if (n1Type == ProjectNodeType) {
        if (n2Type == ProjectNodeType) {
            ProjectNode *project1 = static_cast<ProjectNode*>(n1);
            ProjectNode *project2 = static_cast<ProjectNode*>(n2);
con's avatar
con committed
88

89
            int result = caseFriendlyCompare(project1->displayName(), project2->displayName());
dt's avatar
dt committed
90
            if (result != 0)
dt's avatar
dt committed
91
                return result < 0;
92

93
            result = caseFriendlyCompare(project1->path().toString(), project2->path().toString());
94 95 96
            if (result != 0)
                return result < 0;
            return project1 < project2; // sort by pointer value
hjk's avatar
hjk committed
97 98 99 100 101 102
        } else {
           return true; // project is before folder & file
       }
    }
    if (n2Type == ProjectNodeType)
        return false;
con's avatar
con committed
103

104 105 106 107 108 109 110 111 112
    if (n1Type == VirtualFolderNodeType) {
        if (n2Type == VirtualFolderNodeType) {
            VirtualFolderNode *folder1 = static_cast<VirtualFolderNode *>(n1);
            VirtualFolderNode *folder2 = static_cast<VirtualFolderNode *>(n2);

            if (folder1->priority() > folder2->priority())
                return true;
            if (folder1->priority() < folder2->priority())
                return false;
113
            int result = caseFriendlyCompare(folder1->path().toString(), folder2->path().toString());
114 115 116 117 118 119 120 121 122 123 124 125 126
            if (result != 0)
                return result < 0;
            else
                return folder1 < folder2;
        } else {
            return true; // virtual folder is before folder
        }
    }

    if (n2Type == VirtualFolderNodeType)
        return false;


hjk's avatar
hjk committed
127 128 129 130
    if (n1Type == FolderNodeType) {
        if (n2Type == FolderNodeType) {
            FolderNode *folder1 = static_cast<FolderNode*>(n1);
            FolderNode *folder2 = static_cast<FolderNode*>(n2);
con's avatar
con committed
131

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

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

150 151
        const QString filePath1 = n1->path().toString();
        const QString filePath2 = n2->path().toString();
con's avatar
con committed
152

153 154
        const QString fileName1 = Utils::FileName::fromString(filePath1).fileName();
        const QString fileName2 = Utils::FileName::fromString(filePath2).fileName();
con's avatar
con committed
155

156
        result = caseFriendlyCompare(fileName1, fileName2);
dt's avatar
dt committed
157
        if (result != 0) {
dt's avatar
dt committed
158
            return result < 0; // sort by filename
hjk's avatar
hjk committed
159
        } else {
160
            result = caseFriendlyCompare(filePath1, filePath2);
161
            if (result != 0)
dt's avatar
dt committed
162
                return result < 0; // sort by filepath
163 164 165 166

            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
167 168
        }
    }
hjk's avatar
hjk committed
169
    return false;
con's avatar
con committed
170 171
}

hjk's avatar
hjk committed
172 173
} // namespace anon

con's avatar
con committed
174 175
FlatModel::FlatModel(SessionNode *rootNode, QObject *parent)
        : QAbstractItemModel(parent),
176
          m_filterProjects(false),
con's avatar
con committed
177 178 179 180 181
          m_filterGeneratedFiles(true),
          m_rootNode(rootNode),
          m_startupProject(0),
          m_parentFolderForChange(0)
{
182
    ProjectTree *tree = ProjectTree::instance();
con's avatar
con committed
183

184 185
    connect(tree, &ProjectTree::aboutToChangeShowInSimpleTree,
            this, &FlatModel::aboutToShowInSimpleTreeChanged);
186

187 188
    connect(tree, &ProjectTree::showInSimpleTreeChanged,
            this, &FlatModel::showInSimpleTreeChanged);
189

190 191 192 193
    connect(tree, &ProjectTree::foldersAboutToBeAdded,
            this, &FlatModel::foldersAboutToBeAdded);
    connect(tree, &ProjectTree::foldersAdded,
            this, &FlatModel::foldersAdded);
con's avatar
con committed
194

195 196 197 198
    connect(tree, &ProjectTree::foldersAboutToBeRemoved,
            this, &FlatModel::foldersAboutToBeRemoved);
    connect(tree, &ProjectTree::foldersRemoved,
            this, &FlatModel::foldersRemoved);
con's avatar
con committed
199

200 201 202 203
    connect(tree, &ProjectTree::filesAboutToBeAdded,
            this, &FlatModel::filesAboutToBeAdded);
    connect(tree, &ProjectTree::filesAdded,
            this, &FlatModel::filesAdded);
con's avatar
con committed
204

205 206 207 208
    connect(tree, &ProjectTree::filesAboutToBeRemoved,
            this, &FlatModel::filesAboutToBeRemoved);
    connect(tree, &ProjectTree::filesRemoved,
            this, &FlatModel::filesRemoved);
209

210 211 212 213
    connect(tree, &ProjectTree::nodeSortKeyAboutToChange,
            this, &FlatModel::nodeSortKeyAboutToChange);
    connect(tree, &ProjectTree::nodeSortKeyChanged,
            this, &FlatModel::nodeSortKeyChanged);
214

215 216
    connect(tree, &ProjectTree::nodeUpdated,
            this, &FlatModel::nodeUpdated);
con's avatar
con committed
217 218 219 220 221 222 223 224
}

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) {
225
        FolderNode *parentNode = nodeForIndex(parent)->asFolderNode();
dt's avatar
dt committed
226
        Q_ASSERT(parentNode);
con's avatar
con committed
227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
        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());
245 246
        if (parentNode)
            return indexForNode(parentNode);
con's avatar
con committed
247 248 249 250 251 252 253 254 255
    }
    return parentIndex;
}

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

    if (Node *node = nodeForIndex(index)) {
256
        FolderNode *folderNode = node->asFolderNode();
con's avatar
con committed
257
        switch (role) {
258 259 260
        case Qt::DisplayRole: {
            QString name = node->displayName();

261 262
            if (node->nodeType() == ProjectNodeType
                    && node->parentFolderNode()
263
                    && node->parentFolderNode()->nodeType() == SessionNodeType) {
264
                const QString vcsTopic = static_cast<ProjectNode *>(node)->vcsTopic();
265 266

                if (!vcsTopic.isEmpty())
267
                    name += QLatin1String(" [") + vcsTopic + QLatin1Char(']');
268 269 270 271 272
            }

            result = name;
            break;
        }
con's avatar
con committed
273
        case Qt::EditRole: {
274
            result = node->path().fileName();
con's avatar
con committed
275 276 277
            break;
        }
        case Qt::ToolTipRole: {
278
            result = node->tooltip();
con's avatar
con committed
279 280 281 282 283 284
            break;
        }
        case Qt::DecorationRole: {
            if (folderNode)
                result = folderNode->icon();
            else
285
                result = Core::FileIconProvider::icon(node->path().toString());
con's avatar
con committed
286 287 288 289 290 291 292 293 294
            break;
        }
        case Qt::FontRole: {
            QFont font;
            if (node == m_startupProject)
                font.setBold(true);
            result = font;
            break;
        }
295
        case Project::FilePathRole: {
296
            result = node->path().toString();
con's avatar
con committed
297 298
            break;
        }
299
        case Project::EnabledRole: {
300 301 302
            result = node->isEnabled();
            break;
        }
con's avatar
con committed
303 304 305 306 307 308
        }
    }

    return result;
}

dt's avatar
dt committed
309 310 311 312 313 314 315
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
316 317
    Qt::ItemFlags f = Qt::ItemIsSelectable|Qt::ItemIsEnabled;
    if (Node *node = nodeForIndex(index)) {
318 319
        if (node == m_rootNode)
            return 0; // no flags for session node...
320
        if (!node->asProjectNode()) {
321
            // either folder or file node
322
            if (node->supportedActions(node).contains(Rename))
323
                f = f | Qt::ItemIsEditable;
324
            if (node->asFileNode())
325
                f = f | Qt::ItemIsDragEnabled;
326 327 328
        }
    }
    return f;
dt's avatar
dt committed
329 330 331 332 333 334 335 336 337
}

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

338 339
    Node *node = nodeForIndex(index);

340 341
    Utils::FileName orgFilePath = node->path();
    Utils::FileName newFilePath = orgFilePath.parentDir().appendPath(value.toString());
342

343
    ProjectExplorerPlugin::renameFile(node, newFilePath.toString());
344
    emit renamed(orgFilePath, newFilePath);
dt's avatar
dt committed
345 346 347
    return true;
}

con's avatar
con committed
348 349 350 351 352 353
int FlatModel::rowCount(const QModelIndex &parent) const
{
    int rows = 0;
    if (!parent.isValid()) {
        rows = 1;
    } else {
354
        FolderNode *folderNode = nodeForIndex(parent)->asFolderNode();
con's avatar
con committed
355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
        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;

371
    FolderNode *folderNode = nodeForIndex(parent)->asFolderNode();
con's avatar
con committed
372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387
    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 {
388
        if (FolderNode *folderNode = nodeForIndex(parent)->asFolderNode())
con's avatar
con committed
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429
            return !m_childNodes.contains(folderNode);
        else
            return false;
    }
}

void FlatModel::recursiveAddFolderNodes(FolderNode *startNode, QList<Node *> *list, const QSet<Node *> &blackList) const
{
    foreach (FolderNode *folderNode, startNode->subFolderNodes()) {
        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 {
        foreach (FolderNode *folderNode, startNode->subFolderNodes()) {
            if (folderNode && !blackList.contains(folderNode))
                recursiveAddFolderNodesImpl(folderNode, list, blackList);
        }
    }
}

void FlatModel::recursiveAddFileNodes(FolderNode *startNode, QList<Node *> *list, const QSet<Node *> &blackList) const
{
    foreach (FolderNode *subFolderNode, startNode->subFolderNodes()) {
        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
{
430
    qCDebug(logger()) << "    FlatModel::childNodes for " << parentNode->path();
con's avatar
con committed
431 432 433 434 435 436 437 438 439 440 441 442 443
    QList<Node*> nodeList;

    if (parentNode->nodeType() == SessionNodeType) {
        SessionNode *sessionNode = static_cast<SessionNode*>(parentNode);
        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());
    }
444
    Utils::sort(nodeList, sortNodes);
445
    qCDebug(logger()) << "      found" << nodeList.size() << "nodes";
con's avatar
con committed
446 447 448 449 450
    return nodeList;
}

void FlatModel::fetchMore(FolderNode *folderNode) const
{
dt's avatar
dt committed
451 452
    Q_ASSERT(folderNode);
    Q_ASSERT(!m_childNodes.contains(folderNode));
con's avatar
con committed
453 454 455 456 457 458 459

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

void FlatModel::fetchMore(const QModelIndex &parent)
{
460
    FolderNode *folderNode = nodeForIndex(parent)->asFolderNode();
dt's avatar
dt committed
461
    Q_ASSERT(folderNode);
con's avatar
con committed
462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480

    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()
{
481
    beginResetModel();
con's avatar
con committed
482
    m_childNodes.clear();
483
    endResetModel();
con's avatar
con committed
484 485
}

486 487 488 489 490
Qt::DropActions FlatModel::supportedDragActions() const
{
    return Qt::MoveAction;
}

491 492
QStringList FlatModel::mimeTypes() const
{
493
    return Utils::FileDropSupport::mimeTypesForFilePaths();
494 495 496 497
}

QMimeData *FlatModel::mimeData(const QModelIndexList &indexes) const
{
498
    auto data = new Utils::FileDropMimeData;
499 500
    foreach (const QModelIndex &index, indexes) {
        Node *node = nodeForIndex(index);
501
        if (node->asFileNode())
502
            data->addFile(node->path().toString());
503
    }
504
    return data;
505 506
}

507
QModelIndex FlatModel::indexForNode(const Node *node_) const
con's avatar
con committed
508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536
{
    // We assume that we are only called for nodes that are represented

    // we use non-const pointers internally
    Node *node = const_cast<Node*>(node_);
    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)
{
537 538
    if (filter == m_filterProjects)
        return;
con's avatar
con committed
539 540 541 542 543 544 545 546 547 548
    m_filterProjects = filter;
    reset();
}

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

549 550 551 552 553 554 555 556 557 558
bool FlatModel::projectFilterEnabled()
{
    return m_filterProjects;
}

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

con's avatar
con committed
559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587
Node *FlatModel::nodeForIndex(const QModelIndex &index) const
{
    if (index.isValid())
        return (Node*)index.internalPointer();
    return 0;
}

/*
  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)
        return 0;

    for (FolderNode *folderNode = node;
         folderNode;
         folderNode = folderNode->parentFolderNode()) {
        if (!filter(folderNode))
            return folderNode;
    }
    return 0;
}

bool FlatModel::filter(Node *node) const
{
    bool isHidden = false;
588
    if (FolderNode *folderNode = node->asFolderNode()) {
589
        if (m_filterProjects)
590
            isHidden = !folderNode->showInSimpleTree();
591
    } else if (FileNode *fileNode = node->asFileNode()) {
con's avatar
con committed
592 593 594 595 596 597
        if (m_filterGeneratedFiles)
            isHidden = fileNode->isGenerated();
    }
    return isHidden;
}

598 599 600 601 602 603
const QLoggingCategory &FlatModel::logger()
{
    static QLoggingCategory logger("qtc.projectexplorer.flatmodel");
    return logger;
}

604 605 606 607 608 609 610 611 612 613
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
614 615 616
/// slots and all the fun
void FlatModel::added(FolderNode* parentNode, const QList<Node*> &newNodeList)
{
617
    qCDebug(logger()) << "FlatModel::added" << parentNode->path() << newNodeList.size() << "nodes";
con's avatar
con committed
618 619
    QModelIndex parentIndex = indexForNode(parentNode);
    // Old  list
620 621 622 623 624 625

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

con's avatar
con committed
626
    QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(parentNode);
627 628 629 630 631 632 633 634 635
    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
636
        return;
637
    }
con's avatar
con committed
638 639 640 641 642 643
    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();

644 645 646 647 648 649 650 651 652 653 654 655 656 657 658
    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";
        foreach (Node *n, emptyDifference) {
            qDebug()<<n->path();
        }
        Q_ASSERT(false);
    }

con's avatar
con committed
659 660 661 662 663 664 665 666 667
    // 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();
668
        qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
669 670 671
        return;
    }

hjk's avatar
hjk committed
672
    while (true) {
con's avatar
con committed
673
        // Skip all that are the same
hjk's avatar
hjk committed
674
        while (*oldIter == *newIter) {
con's avatar
con committed
675 676 677 678 679 680 681 682 683 684
            ++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
685
                    while (startOfBlock != newIter) {
con's avatar
con committed
686 687 688 689 690 691 692 693 694 695 696 697
                        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
698
        while (*oldIter != *newIter)
con's avatar
con committed
699 700 701 702 703 704 705 706
            ++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
707
        while (startOfBlock != newIter) {
con's avatar
con committed
708 709 710 711 712 713 714 715
            oldNodeList.insert(pos, *startOfBlock);
            ++pos;
            ++startOfBlock;
        }
        m_childNodes.insert(parentNode, oldNodeList);
        endInsertRows();
        oldIter = oldNodeList.constBegin() + pos;
    }
716
    qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
717 718 719 720
}

void FlatModel::removed(FolderNode* parentNode, const QList<Node*> &newNodeList)
{
721
    qCDebug(logger()) << "FlatModel::removed" << parentNode->path() << newNodeList.size() << "nodes";
con's avatar
con committed
722 723 724
    QModelIndex parentIndex = indexForNode(parentNode);
    // Old  list
    QHash<FolderNode*, QList<Node*> >::const_iterator it = m_childNodes.constFind(parentNode);
725 726
    if (it == m_childNodes.constEnd()) {
        qCDebug(logger()) << "  unmapped node";
con's avatar
con committed
727
        return;
728
    }
729

con's avatar
con committed
730 731 732 733 734
    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();

735 736 737 738 739 740 741 742 743 744 745 746 747 748
    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";
        foreach (Node *n, emptyDifference) {
            qDebug()<<n->path();
        }
        Q_ASSERT(false);
    }

con's avatar
con committed
749 750 751 752 753 754 755 756 757
    // 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();
758
        qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
759 760 761
        return;
    }

hjk's avatar
hjk committed
762
    while (true) {
con's avatar
con committed
763
        // Skip all that are the same
hjk's avatar
hjk committed
764
        while (*oldIter == *newIter) {
con's avatar
con committed
765 766 767 768 769 770 771 772 773 774
            ++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
775
                    while (startOfBlock != oldIter) {
con's avatar
con committed
776 777 778 779 780 781 782 783 784 785 786 787
                        ++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
788
        while (*oldIter != *newIter)
con's avatar
con committed
789 790 791 792 793 794 795 796
            ++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
797
        while (startOfBlock != oldIter) {
con's avatar
con committed
798 799 800 801 802 803 804
            ++startOfBlock;
            oldNodeList.removeAt(pos);
        }
        m_childNodes.insert(parentNode, oldNodeList);
        endRemoveRows();
        oldIter = oldNodeList.constBegin() + pos;
    }
805
    qCDebug(logger()) << "  updated m_childNodes";
con's avatar
con committed
806 807
}

808
void FlatModel::aboutToShowInSimpleTreeChanged(FolderNode* node)
809 810 811 812 813 814 815 816 817 818
{
    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)
819
        if (FolderNode *fn = n->asFolderNode())
820 821 822
            m_childNodes.remove(fn);
}

823
void FlatModel::showInSimpleTreeChanged(FolderNode *node)
824 825 826 827 828 829 830 831 832
{
    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
833 834
void FlatModel::foldersAboutToBeAdded(FolderNode *parentFolder, const QList<FolderNode*> &newFolders)
{
835
    qCDebug(logger()) << "FlatModel::foldersAboutToBeAdded";
con's avatar
con committed
836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853
    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
854
    foreach (FolderNode *node, staleFolders)
con's avatar
con committed
855 856 857 858 859
        blackList.insert(node);

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

860
    removed(folderNode, newNodeList);
con's avatar
con committed
861 862 863 864 865
    removeFromCache(staleFolders);
}

void FlatModel::removeFromCache(QList<FolderNode *> list)
{
hjk's avatar
hjk committed
866
    foreach (FolderNode *fn, list) {
con's avatar
con committed
867 868 869 870 871
        removeFromCache(fn->subFolderNodes());
        m_childNodes.remove(fn);
    }
}

872 873
void FlatModel::changedSortKey(FolderNode *folderNode, Node *node)
{
874 875 876
    if (!m_childNodes.contains(folderNode))
        return; // The directory was not yet mapped, so there is no need to sort it.

877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896
    QList<Node *> nodes = m_childNodes.value(folderNode);
    int oldIndex = nodes.indexOf(node);

    nodes.removeAt(oldIndex);
    QList<Node *>::iterator newPosIt = qLowerBound(nodes.begin(), nodes.end(), node, sortNodes);
    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
897 898 899 900 901 902 903
void FlatModel::foldersRemoved()
{
    // Do nothing
}

void FlatModel::filesAboutToBeAdded(FolderNode *folder, const QList<FileNode*> &newFiles)
{
904
    qCDebug(logger()) << "FlatModel::filesAboutToBeAdded";
con's avatar
con committed
905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924
    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;
925
    foreach (Node *node, staleFiles)
con's avatar
con committed
926 927 928 929 930 931 932 933 934 935 936
        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
}
937

938 939 940 941 942 943 944 945 946 947 948
void FlatModel::nodeSortKeyAboutToChange(Node *node)
{
    m_nodeForSortKeyChange = node;
}

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

949 950 951 952 953 954
void FlatModel::nodeUpdated(Node *node)
{
    QModelIndex idx = indexForNode(node);
    emit dataChanged(idx, idx);
}

955 956 957 958 959 960 961 962 963 964 965
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);
}

}
966 967

} // namespace ProjectExplorer
968