Method testPathGrouping

kdevplatform/shell/tests/test_filteredproblemstore.cpp:304–442

}

void TestFilteredProblemStore::testPathGrouping()
{
    m_store->clear();

    // Rebuild the problem list with grouping
    m_store->setGrouping(PathGrouping);

    // Add problems
    for (const IProblem::Ptr& p : std::as_const(m_problems)) {
        m_store->addProblem(p);
    }

    QCOMPARE(m_store->count(), ProblemsCount);

    for (int i = 0; i < 3; i++) {
        const ProblemStoreNode *node = m_store->findNode(i);
        checkNodeLabel(node, m_problems[i]->finalLocation().document.str());
        QCOMPARE(node->count(), 1);

        checkNodeDescription(node->child(0), m_problems[i]->description());
    }


    // Now add a new problem
    IProblem::Ptr p(new DetectedProblem());
    p->setDescription(QStringLiteral("PROBLEM4"));
    p->setFinalLocation(m_problems[2]->finalLocation());
    m_store->addProblem(p);

    QCOMPARE(m_store->count(), ProblemsCount);

    // Check the first 2 top-nodes
    for (int i = 0; i < 2; i++) {
        const ProblemStoreNode *node = m_store->findNode(i);
        checkNodeLabel(node, m_problems[i]->finalLocation().document.str());
        QCOMPARE(node->count(), 1);

        checkNodeDescription(node->child(0), m_problems[i]->description());
    }

    // check the last one, and check the added problem is at the right place
    {
        const ProblemStoreNode *node = m_store->findNode(2);
        checkNodeLabel(node, m_problems[2]->finalLocation().document.str());
        QCOMPARE(node->count(), 2);

        checkNodeDescription(node->child(1), p->description());
    }

    m_store->clear();
    m_store->setProblems(m_problems);

    // Check filters
    // old-style setSeverity
    // Error filter
    m_store->setSeverity(IProblem::Error);
    QCOMPARE(m_store->count(), ErrorFilterProblemCount);
    {