raytracing/raytracer_challenge
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[FEAT] Add a test for Cube

Browse Source
This commit is contained in:
NADAL Jean-Baptiste
2024-03-14 17:32:14 +01:00
parent 26282306a3
commit 03c825bd3a
3 changed files with 80 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
tests/12_cubes.cpp
View File

@@ -33,7 +33,18 @@ using namespace Raytracer;
/* ------------------------------------------------------------------------- */
SCENARIO("Reflectivity for the default material", "[features/cubes.feature]")
class CubeTest
{
public:
Tuple origin;
Tuple direction;
double t1;
double t2;
};
/* ------------------------------------------------------------------------- */
SCENARIO("A Ray intersects a cube", "[features/cubes.feature]")
{
// | | origin | direction | t1 | t2 |
// | +x | point(5, 0.5, 0) | vector(-1, 0, 0) | 4 | 6 |
@@ -43,6 +54,16 @@ SCENARIO("Reflectivity for the default material", "[features/cubes.feature]")
// | +z | point(0.5, 0, 5) | vector( 0, 0,-1) | 4 | 6 |
// | -z | point(0.5, 0, -5) | vector( 0, 0, 1) | 4 | 6 |
// | inside | point(0, 0.5, 0) | vector( 0, 0, 1) | -1 | -1 |
CubeTest the_test[7] = {
{ Tuple::Point(5.0, 0.5, 0.0), Tuple::Vector(-1, 0, 0), 4, 6},
{Tuple::Point(-5.0, 0.5, 0.0), Tuple::Vector(1, 0, 0), 4, 6},
{ Tuple::Point(0.5, 5.0, 0.0), Tuple::Vector(0, -1, 0), 4, 6},
{ Tuple::Point(0.5, -5.0, 0.0), Tuple::Vector(0, 1, 0), 4, 6},
{ Tuple::Point(0.5, 0.0, 5.0), Tuple::Vector(0, 0, -1), 4, 6},
{ Tuple::Point(0.5, 0.0, -5.0), Tuple::Vector(0, 0, 1), 4, 6},
{ Tuple::Point(0.0, 0.5, 0.0), Tuple::Vector(0, 0, 1), -1, -1}
};
GIVEN("c <- cube()")
{
Cube c;
@@ -50,17 +71,22 @@ SCENARIO("Reflectivity for the default material", "[features/cubes.feature]")
{
WHEN("xs <- local_intersect(c,r)")
{
THEN("xs.count = 2")
for (int i = 0; i < 7; i++)
{
// REQUIRE();
}
AND_THEN("xs[0].t = <t1>")
{
// REQUIRE();
}
AND_THEN("xs[1].t = <t2>")
{
// REQUIRE();
Ray r(the_test[i].origin, the_test[i].direction);
Intersections xs = c.local_intersect(r);
THEN("xs.count = 2")
{
REQUIRE(xs.count() == 2);
}
AND_THEN("xs[0].t = <t1>")
{
REQUIRE(xs[0].distance_t() == the_test[i].t1);
}
AND_THEN("xs[1].t = <t2>")
{
REQUIRE(xs[1].distance_t() == the_test[i].t2);
}
}
}
}