Function TEST_F

tests/test-scheduler-priority.cpp:350–487

* @brief Test basic scheduler hierarchy setup and validation (based on example11) * * TESTS: setHighPriorityScheduler(), currentScheduler(), currentTask() * * PURPOSE: Verify that scheduler hierarchy can be established correctly * and that the priority relationships work as expected for basic scenarios, * following the pattern from Scheduler_example11_Priority. * * PRIORITY HIERARCHY SETUP

 * - Priority evaluation follows documented sequence
 */
TEST_F(PrioritySchedulerTest, BasicSchedulerHierarchy) {
    // Create base and high priority schedulers (matching example11)
    Scheduler base_scheduler;
    Scheduler high_scheduler;

    // Establish hierarchy - high scheduler has priority over base
    base_scheduler.setHighPriorityScheduler(&high_scheduler);

    // Add tasks to schedulers with intervals matching example11
    // Base priority tasks: longer intervals
    Task t1(1000, 3, &priority_test_callback, &base_scheduler, false);  // 1000ms interval
    Task t2(2000, 2, &priority_test_callback, &base_scheduler, false);  // 2000ms interval
    Task t3(3000, 1, &priority_test_callback, &base_scheduler, false);  // 3000ms interval

    // High priority tasks: shorter intervals for more frequent execution
    Task t4(500, 6, &priority_test_callback, &high_scheduler, false);   // 500ms interval
    Task t5(1000, 3, &priority_test_callback, &high_scheduler, false);  // 1000ms interval

    // Set task IDs for identification (like in example11)
    t1.setId(1);
    t2.setId(2);
    t3.setId(3);
    t4.setId(4);
    t5.setId(5);

    // Enable all tasks recursively (like example11: enableAll(true))
    base_scheduler.enableAll(true);

    // Verify tasks are enabled
    EXPECT_TRUE(t1.isEnabled());
    EXPECT_TRUE(t2.isEnabled());
    EXPECT_TRUE(t3.isEnabled());
    EXPECT_TRUE(t4.isEnabled());
    EXPECT_TRUE(t5.isEnabled());

    // Execute scheduler for sufficient time to see priority pattern
    // High priority tasks should execute more frequently due to shorter intervals
    bool success = runPrioritySchedulerUntil(base_scheduler, []() {
        return priority_callback_counter >= 15; // 6+3=9 high + 3+2+1=6 base = 15 total
    }, 5000);

    EXPECT_TRUE(success);
    EXPECT_EQ(priority_callback_counter, 15);

    // Count executions by task ID to verify the priority pattern
    int task1_count = 0, task2_count = 0, task3_count = 0;  // Base priority tasks
    int task4_count = 0, task5_count = 0;                   // High priority tasks

    for (size_t i = 0; i < getPriorityTestOutputCount(); i++) {
        std::string output = getPriorityTestOutput(i);
        if (output == "task_1_executed") task1_count++;
        else if (output == "task_2_executed") task2_count++;
        else if (output == "task_3_executed") task3_count++;
        else if (output == "task_4_executed") task4_count++;
        else if (output == "task_5_executed") task5_count++;
    }

    // Verify execution counts match expected iterations