2023-01-05 13:25:55 +01:00
|
|
|
/**************************************************************************/
|
|
|
|
/* test_path_follow_2d.h */
|
|
|
|
/**************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
|
|
|
/* https://godotengine.org */
|
|
|
|
/**************************************************************************/
|
|
|
|
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
|
|
|
|
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
|
|
|
|
/* */
|
|
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
|
|
/* a copy of this software and associated documentation files (the */
|
|
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
|
|
/* the following conditions: */
|
|
|
|
/* */
|
|
|
|
/* The above copyright notice and this permission notice shall be */
|
|
|
|
/* included in all copies or substantial portions of the Software. */
|
|
|
|
/* */
|
|
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
|
|
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
|
|
/**************************************************************************/
|
2021-02-21 12:01:54 +01:00
|
|
|
|
|
|
|
#ifndef TEST_PATH_FOLLOW_2D_H
|
|
|
|
#define TEST_PATH_FOLLOW_2D_H
|
|
|
|
|
|
|
|
#include "scene/2d/path_2d.h"
|
|
|
|
|
|
|
|
#include "tests/test_macros.h"
|
|
|
|
|
|
|
|
namespace TestPathFollow2D {
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
TEST_CASE("[PathFollow2D] Sampling with progress ratio") {
|
2021-02-21 12:01:54 +01:00
|
|
|
const Ref<Curve2D> &curve = memnew(Curve2D());
|
|
|
|
curve->add_point(Vector2(0, 0));
|
|
|
|
curve->add_point(Vector2(100, 0));
|
|
|
|
curve->add_point(Vector2(100, 100));
|
|
|
|
curve->add_point(Vector2(0, 100));
|
|
|
|
curve->add_point(Vector2(0, 0));
|
2021-02-27 16:29:11 +01:00
|
|
|
const Path2D *path = memnew(Path2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->set_curve(curve);
|
2021-02-27 16:29:11 +01:00
|
|
|
const PathFollow2D *path_follow_2d = memnew(PathFollow2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->add_child(path_follow_2d);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 0)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.125);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(50, 0)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.25);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 0)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.375);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 50)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.5);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 100)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.625);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(50, 100)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.75);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 100)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.875);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 50)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(1);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 0)));
|
2021-02-27 16:29:11 +01:00
|
|
|
|
|
|
|
memdelete(path);
|
2021-02-21 12:01:54 +01:00
|
|
|
}
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
TEST_CASE("[PathFollow2D] Sampling with progress") {
|
2021-02-21 12:01:54 +01:00
|
|
|
const Ref<Curve2D> &curve = memnew(Curve2D());
|
|
|
|
curve->add_point(Vector2(0, 0));
|
|
|
|
curve->add_point(Vector2(100, 0));
|
|
|
|
curve->add_point(Vector2(100, 100));
|
|
|
|
curve->add_point(Vector2(0, 100));
|
|
|
|
curve->add_point(Vector2(0, 0));
|
2021-02-27 16:29:11 +01:00
|
|
|
const Path2D *path = memnew(Path2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->set_curve(curve);
|
2021-02-27 16:29:11 +01:00
|
|
|
const PathFollow2D *path_follow_2d = memnew(PathFollow2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->add_child(path_follow_2d);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(0);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 0)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(50);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(50, 0)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(100);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 0)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(150);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 50)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(200);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 100)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(250);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(50, 100)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(300);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 100)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(350);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 50)));
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(400);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(0, 0)));
|
2021-02-27 16:29:11 +01:00
|
|
|
|
|
|
|
memdelete(path);
|
2021-02-21 12:01:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("[PathFollow2D] Removal of a point in curve") {
|
|
|
|
const Ref<Curve2D> &curve = memnew(Curve2D());
|
|
|
|
curve->add_point(Vector2(0, 0));
|
|
|
|
curve->add_point(Vector2(100, 0));
|
|
|
|
curve->add_point(Vector2(100, 100));
|
2021-02-27 16:29:11 +01:00
|
|
|
const Path2D *path = memnew(Path2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->set_curve(curve);
|
2021-02-27 16:29:11 +01:00
|
|
|
const PathFollow2D *path_follow_2d = memnew(PathFollow2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->add_child(path_follow_2d);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.5);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(100, 0)));
|
|
|
|
|
|
|
|
curve->remove_point(1);
|
|
|
|
|
|
|
|
CHECK_MESSAGE(
|
|
|
|
path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(50, 50)),
|
|
|
|
"Path follow's position should be updated after removing a point from the curve");
|
2021-02-27 16:29:11 +01:00
|
|
|
|
|
|
|
memdelete(path);
|
2021-02-21 12:01:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("[PathFollow2D] Setting h_offset and v_offset") {
|
|
|
|
const Ref<Curve2D> &curve = memnew(Curve2D());
|
|
|
|
curve->add_point(Vector2(0, 0));
|
|
|
|
curve->add_point(Vector2(100, 0));
|
2021-02-27 16:29:11 +01:00
|
|
|
const Path2D *path = memnew(Path2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->set_curve(curve);
|
2021-02-27 16:29:11 +01:00
|
|
|
const PathFollow2D *path_follow_2d = memnew(PathFollow2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->add_child(path_follow_2d);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(0.5);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(50, 0)));
|
|
|
|
|
|
|
|
path_follow_2d->set_h_offset(25);
|
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(75, 0)));
|
|
|
|
|
|
|
|
path_follow_2d->set_v_offset(25);
|
|
|
|
CHECK(path_follow_2d->get_transform().get_origin().is_equal_approx(Vector2(75, 25)));
|
2021-02-27 16:29:11 +01:00
|
|
|
|
|
|
|
memdelete(path);
|
2021-02-21 12:01:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("[PathFollow2D] Unit offset out of range") {
|
|
|
|
const Ref<Curve2D> &curve = memnew(Curve2D());
|
|
|
|
curve->add_point(Vector2(0, 0));
|
|
|
|
curve->add_point(Vector2(100, 0));
|
2021-02-27 16:29:11 +01:00
|
|
|
const Path2D *path = memnew(Path2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->set_curve(curve);
|
2021-02-27 16:29:11 +01:00
|
|
|
const PathFollow2D *path_follow_2d = memnew(PathFollow2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->add_child(path_follow_2d);
|
|
|
|
|
|
|
|
path_follow_2d->set_loop(true);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(-0.3);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress_ratio() == 0.7,
|
|
|
|
"Progress Ratio should loop back from the end in the opposite direction");
|
2021-02-21 12:01:54 +01:00
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(1.3);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress_ratio() == 0.3,
|
|
|
|
"Progress Ratio should loop back from the end in the opposite direction");
|
2021-02-21 12:01:54 +01:00
|
|
|
|
|
|
|
path_follow_2d->set_loop(false);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(-0.3);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress_ratio() == 0,
|
|
|
|
"Progress Ratio should be clamped at 0");
|
2021-02-21 12:01:54 +01:00
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress_ratio(1.3);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress_ratio() == 1,
|
|
|
|
"Progress Ratio should be clamped at 1");
|
2021-02-27 16:29:11 +01:00
|
|
|
|
|
|
|
memdelete(path);
|
2021-02-21 12:01:54 +01:00
|
|
|
}
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
TEST_CASE("[PathFollow2D] Progress out of range") {
|
2021-02-21 12:01:54 +01:00
|
|
|
const Ref<Curve2D> &curve = memnew(Curve2D());
|
|
|
|
curve->add_point(Vector2(0, 0));
|
|
|
|
curve->add_point(Vector2(100, 0));
|
2021-02-27 16:29:11 +01:00
|
|
|
const Path2D *path = memnew(Path2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->set_curve(curve);
|
2021-02-27 16:29:11 +01:00
|
|
|
const PathFollow2D *path_follow_2d = memnew(PathFollow2D);
|
2021-02-21 12:01:54 +01:00
|
|
|
path->add_child(path_follow_2d);
|
|
|
|
|
|
|
|
path_follow_2d->set_loop(true);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(-50);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress() == 50,
|
|
|
|
"Progress should loop back from the end in the opposite direction");
|
2021-02-21 12:01:54 +01:00
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(150);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress() == 50,
|
|
|
|
"Progress should loop back from the end in the opposite direction");
|
2021-02-21 12:01:54 +01:00
|
|
|
|
|
|
|
path_follow_2d->set_loop(false);
|
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(-50);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress() == 0,
|
|
|
|
"Progress should be clamped at 0");
|
2021-02-21 12:01:54 +01:00
|
|
|
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->set_progress(150);
|
2021-02-21 12:01:54 +01:00
|
|
|
CHECK_MESSAGE(
|
2022-08-23 23:41:41 +02:00
|
|
|
path_follow_2d->get_progress() == 100,
|
|
|
|
"Progress should be clamped at 1");
|
2021-02-27 16:29:11 +01:00
|
|
|
|
|
|
|
memdelete(path);
|
2021-02-21 12:01:54 +01:00
|
|
|
}
|
|
|
|
} // namespace TestPathFollow2D
|
|
|
|
|
|
|
|
#endif // TEST_PATH_FOLLOW_2D_H
|