Function FL_TEST_FILE

tests/fl/stl/circular_buffer.cpp:4–504

#include "test.h"

FL_TEST_FILE(FL_FILEPATH) {

using namespace fl;

FL_TEST_CASE("fl::circular_buffer - basic operations") {
    FL_SUBCASE("constructor creates empty buffer") {
        circular_buffer<int, 5> buffer;
        FL_CHECK(buffer.empty());
        FL_CHECK_EQ(buffer.size(), 0);
        FL_CHECK_EQ(buffer.capacity(), 5);
        FL_CHECK_FALSE(buffer.full());
    }

    FL_SUBCASE("push and pop single element") {
        circular_buffer<int, 5> buffer;
        buffer.push(42);
        FL_CHECK_FALSE(buffer.empty());
        FL_CHECK_EQ(buffer.size(), 1);

        int value;
        FL_CHECK(buffer.pop(value));
        FL_CHECK_EQ(value, 42);
        FL_CHECK(buffer.empty());
        FL_CHECK_EQ(buffer.size(), 0);
    }

    FL_SUBCASE("push multiple elements") {
        circular_buffer<int, 5> buffer;
        buffer.push(1);
        buffer.push(2);
        buffer.push(3);
        FL_CHECK_EQ(buffer.size(), 3);

        int value;
        FL_CHECK(buffer.pop(value));
        FL_CHECK_EQ(value, 1);
        FL_CHECK(buffer.pop(value));
        FL_CHECK_EQ(value, 2);
        FL_CHECK(buffer.pop(value));
        FL_CHECK_EQ(value, 3);
        FL_CHECK(buffer.empty());
    }

    FL_SUBCASE("fill to capacity") {
        circular_buffer<int, 5> buffer;
        for (int i = 0; i < 5; i++) {
            buffer.push(i);
        }
        FL_CHECK_EQ(buffer.size(), 5);
        FL_CHECK(buffer.full());
        FL_CHECK_FALSE(buffer.empty());
    }

    FL_SUBCASE("overflow behavior - overwrites oldest") {
        circular_buffer<int, 3> buffer;
        buffer.push(1);
        buffer.push(2);
        buffer.push(3);