Function TEST

src/utils/test/priority_queue.cpp:60–107

typedef priority_queue<queue_data *, 3> my_priority_queue;
TEST(core, priority_queue)
{
    my_priority_queue q("my_priority_queue_name");
    ASSERT_EQ("my_priority_queue_name", q.get_name());
    ASSERT_EQ(0, q.count());
    ASSERT_EQ(nullptr, q.dequeue());

    std::vector<queue_data> datas;
    datas.push_back(queue_data(0, 1));
    datas.push_back(queue_data(2, 1));
    datas.push_back(queue_data(1, 1));
    datas.push_back(queue_data(1, 2));
    datas.push_back(queue_data(2, 2));
    datas.push_back(queue_data(0, 2));
    datas.push_back(queue_data(1, 3));
    datas.push_back(queue_data(0, 3));
    datas.push_back(queue_data(2, 3));

    for (int i = 0; i < datas.size(); ++i) {
        ASSERT_EQ(i, q.count());
        queue_data *d = &datas[i];
        ASSERT_EQ(i + 1, q.enqueue(d, d->priority));
        ASSERT_EQ(i + 1, q.count());
    }

    std::vector<queue_data> sort_datas(datas);
    std::sort(sort_datas.begin(), sort_datas.end(), [](const queue_data &l, const queue_data &r) {
        return l.priority > r.priority ||
               (l.priority == r.priority && l.queue_index < r.queue_index);
    });

    int count = sort_datas.size();
    for (int i = 0; i < count; ++i) {
        ASSERT_EQ(count, q.count());
        queue_data *d = nullptr;
        if (i % 2 == 0) {
            d = q.dequeue();
        } else {
            long ct;
            d = q.dequeue(ct);
            ASSERT_EQ(count - 1, ct);
        }
        ASSERT_EQ(sort_datas[i].priority, d->priority);
        ASSERT_EQ(sort_datas[i].queue_index, d->queue_index);
        ASSERT_EQ(count - 1, q.count());
        count--;
    }
}

typedef blocking_priority_queue<queue_data *, 3> my_blocking_priority_queue;
TEST(core, blocking_priority_queue)