Method verify

kdevplatform/util/tests/test_embeddedfreetree.cpp:187–205

    }

    void verify()
    {
        //1. verify order
        uint last = 0;
        uint freeCount = 0;
        for (auto& d : std::as_const(data)) {
            if (d.value) {
                QVERIFY(last < d.value);
                last = d.value;
            } else {
                ++freeCount;
            }
        }

        KDevelop::EmbeddedTreeAlgorithms<TestItem, TestItemHandler> algorithms(data.data(), data.size(), m_centralFree);
        uint countFree = algorithms.countFreeItems();
        QCOMPARE(freeCount, countFree);
        algorithms.verifyTreeConsistent();
    }

    uint getItem(uint number) const
    {