181 lines
5.0 KiB
C
181 lines
5.0 KiB
C
|
/**
|
||
|
* test_sequence.h
|
||
|
* =============================================================================
|
||
|
* Copyright 2021-2023 Serhii Snitsaruk
|
||
|
*
|
||
|
* Use of this source code is governed by an MIT-style
|
||
|
* license that can be found in the LICENSE file or at
|
||
|
* https://opensource.org/licenses/MIT.
|
||
|
* =============================================================================
|
||
|
*/
|
||
|
|
||
|
#ifndef TEST_SEQUENCE_H
|
||
|
#define TEST_SEQUENCE_H
|
||
|
|
||
|
#include "tests/test_macros.h"
|
||
|
|
||
|
#include "modules/limboai/bt/tasks/bt_task.h"
|
||
|
#include "modules/limboai/bt/tasks/composites/bt_sequence.h"
|
||
|
#include "modules/limboai/tests/tasks/bt_test_action.h"
|
||
|
|
||
|
namespace TestSequence {
|
||
|
|
||
|
TEST_CASE("[Modules][LimboAI] BTSequence when all return SUCCESS") {
|
||
|
Ref<BTSequence> seq = memnew(BTSequence);
|
||
|
Ref<BTTestAction> task1 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
Ref<BTTestAction> task2 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
Ref<BTTestAction> task3 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
|
||
|
seq->add_child(task1);
|
||
|
seq->add_child(task2);
|
||
|
seq->add_child(task3);
|
||
|
|
||
|
REQUIRE(seq->get_child_count() == 3);
|
||
|
|
||
|
// * First execution.
|
||
|
CHECK(seq->execute(0.1666) == BTTask::SUCCESS);
|
||
|
|
||
|
CHECK(task1->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task2->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task3->get_status() == BTTask::SUCCESS);
|
||
|
|
||
|
CHECK(task1->num_entries == 1);
|
||
|
CHECK(task1->num_ticks == 1);
|
||
|
CHECK(task1->num_exits == 1);
|
||
|
|
||
|
CHECK(task2->num_entries == 1);
|
||
|
CHECK(task2->num_ticks == 1);
|
||
|
CHECK(task2->num_exits == 1);
|
||
|
|
||
|
CHECK(task3->num_entries == 1);
|
||
|
CHECK(task3->num_ticks == 1);
|
||
|
CHECK(task3->num_exits == 1);
|
||
|
|
||
|
// * Second execution.
|
||
|
CHECK(seq->execute(0.1666) == BTTask::SUCCESS);
|
||
|
|
||
|
CHECK(task1->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task2->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task3->get_status() == BTTask::SUCCESS);
|
||
|
|
||
|
CHECK(task1->num_entries == 2);
|
||
|
CHECK(task1->num_ticks == 2);
|
||
|
CHECK(task1->num_exits == 2);
|
||
|
|
||
|
CHECK(task2->num_entries == 2);
|
||
|
CHECK(task2->num_ticks == 2);
|
||
|
CHECK(task2->num_exits == 2);
|
||
|
|
||
|
CHECK(task3->num_entries == 2);
|
||
|
CHECK(task3->num_ticks == 2);
|
||
|
CHECK(task3->num_exits == 2);
|
||
|
}
|
||
|
|
||
|
TEST_CASE("[Modules][LimboAI] BTSequence when second returns FAILURE") {
|
||
|
Ref<BTSequence> seq = memnew(BTSequence);
|
||
|
Ref<BTTestAction> task1 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
Ref<BTTestAction> task2 = memnew(BTTestAction(BTTask::FAILURE));
|
||
|
Ref<BTTestAction> task3 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
|
||
|
seq->add_child(task1);
|
||
|
seq->add_child(task2);
|
||
|
seq->add_child(task3);
|
||
|
|
||
|
REQUIRE(seq->get_child_count() == 3);
|
||
|
|
||
|
// * First execution.
|
||
|
CHECK(seq->execute(0.1666) == BTTask::FAILURE);
|
||
|
|
||
|
CHECK(task1->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task2->get_status() == BTTask::FAILURE);
|
||
|
CHECK(task3->get_status() == BTTask::FRESH);
|
||
|
|
||
|
CHECK(task1->num_entries == 1);
|
||
|
CHECK(task1->num_ticks == 1);
|
||
|
CHECK(task1->num_exits == 1);
|
||
|
|
||
|
CHECK(task2->num_entries == 1);
|
||
|
CHECK(task2->num_ticks == 1);
|
||
|
CHECK(task2->num_exits == 1);
|
||
|
|
||
|
CHECK(task3->num_entries == 0);
|
||
|
CHECK(task3->num_ticks == 0);
|
||
|
CHECK(task3->num_exits == 0);
|
||
|
|
||
|
// * Second execution.
|
||
|
CHECK(seq->execute(0.1666) == BTTask::FAILURE);
|
||
|
|
||
|
CHECK(task1->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task2->get_status() == BTTask::FAILURE);
|
||
|
CHECK(task3->get_status() == BTTask::FRESH);
|
||
|
|
||
|
CHECK(task1->num_entries == 2);
|
||
|
CHECK(task1->num_ticks == 2);
|
||
|
CHECK(task1->num_exits == 2);
|
||
|
|
||
|
CHECK(task2->num_entries == 2);
|
||
|
CHECK(task2->num_ticks == 2);
|
||
|
CHECK(task2->num_exits == 2);
|
||
|
|
||
|
CHECK(task3->num_entries == 0);
|
||
|
CHECK(task3->num_ticks == 0);
|
||
|
CHECK(task3->num_exits == 0);
|
||
|
}
|
||
|
|
||
|
TEST_CASE("[Modules][LimboAI] BTSequence when second returns RUNNING") {
|
||
|
Ref<BTSequence> seq = memnew(BTSequence);
|
||
|
Ref<BTTestAction> task1 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
Ref<BTTestAction> task2 = memnew(BTTestAction(BTTask::RUNNING));
|
||
|
Ref<BTTestAction> task3 = memnew(BTTestAction(BTTask::SUCCESS));
|
||
|
|
||
|
seq->add_child(task1);
|
||
|
seq->add_child(task2);
|
||
|
seq->add_child(task3);
|
||
|
|
||
|
REQUIRE(seq->get_child_count() == 3);
|
||
|
|
||
|
// * First execution.
|
||
|
CHECK(seq->execute(0.1666) == BTTask::RUNNING);
|
||
|
|
||
|
CHECK(task1->get_status() == BTTask::SUCCESS);
|
||
|
CHECK(task2->get_status() == BTTask::RUNNING);
|
||
|
CHECK(task3->get_status() == BTTask::FRESH);
|
||
|
|
||
|
CHECK(task1->num_entries == 1);
|
||
|
CHECK(task1->num_exits == 1);
|
||
|
CHECK(task1->num_ticks == 1);
|
||
|
|
||
|
CHECK(task2->num_entries == 1);
|
||
|
CHECK(task2->num_ticks == 1);
|
||
|
CHECK(task2->num_exits == 0);
|
||
|
|
||
|
CHECK(task3->num_entries == 0);
|
||
|
CHECK(task3->num_ticks == 0);
|
||
|
CHECK(task3->num_exits == 0);
|
||
|
|
||
|
// * Second execution.
|
||
|
CHECK(seq->execute(0.1666) == BTTask::RUNNING);
|
||
|
|
||
|
CHECK(task1->num_entries == 1);
|
||
|
CHECK(task1->num_exits == 1);
|
||
|
CHECK(task1->num_ticks == 1);
|
||
|
|
||
|
CHECK(task2->num_entries == 1);
|
||
|
CHECK(task2->num_ticks == 2);
|
||
|
CHECK(task2->num_exits == 0);
|
||
|
|
||
|
CHECK(task3->num_entries == 0);
|
||
|
CHECK(task3->num_ticks == 0);
|
||
|
CHECK(task3->num_exits == 0);
|
||
|
}
|
||
|
|
||
|
TEST_CASE("[Modules][LimboAI] BTSequence with no child tasks") {
|
||
|
Ref<BTSequence> seq = memnew(BTSequence);
|
||
|
|
||
|
REQUIRE(seq->get_child_count() == 0);
|
||
|
CHECK(seq->execute(0.1666) == BTTask::SUCCESS);
|
||
|
}
|
||
|
|
||
|
} //namespace TestSequence
|
||
|
|
||
|
#endif // TEST_SEQUENCE_H
|