Function FL_TEST_FILE

tests/fl/stl/priority_queue.cpp:10–482

#include "fl/stl/cstddef.h"

FL_TEST_FILE(FL_FILEPATH) {

using namespace fl;

// ============================================================================
// Tests for fl::PriorityQueue (standard max-heap priority queue)
// ============================================================================

FL_TEST_CASE("fl::PriorityQueue basic operations") {
    FL_SUBCASE("default constructor") {
        PriorityQueue<int> pq;
        FL_CHECK(pq.empty());
        FL_CHECK_EQ(pq.size(), 0u);
    }

    FL_SUBCASE("push and top") {
        PriorityQueue<int> pq;
        pq.push(5);
        FL_CHECK(!pq.empty());
        FL_CHECK_EQ(pq.size(), 1u);
        FL_CHECK_EQ(pq.top(), 5);

        pq.push(3);
        FL_CHECK_EQ(pq.size(), 2u);
        FL_CHECK_EQ(pq.top(), 5);  // Max heap by default

        pq.push(7);
        FL_CHECK_EQ(pq.size(), 3u);
        FL_CHECK_EQ(pq.top(), 7);
    }

    FL_SUBCASE("pop operations") {
        PriorityQueue<int> pq;
        pq.push(5);
        pq.push(3);
        pq.push(7);
        pq.push(1);
        pq.push(9);

        FL_CHECK_EQ(pq.top(), 9);
        pq.pop();
        FL_CHECK_EQ(pq.top(), 7);
        pq.pop();
        FL_CHECK_EQ(pq.top(), 5);
        pq.pop();
        FL_CHECK_EQ(pq.top(), 3);
        pq.pop();
        FL_CHECK_EQ(pq.top(), 1);
        pq.pop();
        FL_CHECK(pq.empty());
    }
}

FL_TEST_CASE("fl::PriorityQueue with custom comparator") {
    FL_SUBCASE("min heap with custom comparator") {
        // Use custom comparator for min heap (opposite of default)
        struct Greater {
            bool operator()(int a, int b) const { return a > b; }