mirror of https://github.com/minetest/minetest.git
102 lines
3.1 KiB
C++
102 lines
3.1 KiB
C++
/*
|
|
Minetest
|
|
Copyright (C) 2013 celeron55, Perttu Ahola <celeron55@gmail.com>
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
|
|
#include "test.h"
|
|
|
|
#include "gamedef.h"
|
|
#include "voxelalgorithms.h"
|
|
#include "util/numeric.h"
|
|
|
|
class TestVoxelAlgorithms : public TestBase {
|
|
public:
|
|
TestVoxelAlgorithms() { TestManager::registerTestModule(this); }
|
|
const char *getName() { return "TestVoxelAlgorithms"; }
|
|
|
|
void runTests(IGameDef *gamedef);
|
|
|
|
void testVoxelLineIterator(const NodeDefManager *ndef);
|
|
};
|
|
|
|
static TestVoxelAlgorithms g_test_instance;
|
|
|
|
void TestVoxelAlgorithms::runTests(IGameDef *gamedef)
|
|
{
|
|
const NodeDefManager *ndef = gamedef->getNodeDefManager();
|
|
|
|
TEST(testVoxelLineIterator, ndef);
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
void TestVoxelAlgorithms::testVoxelLineIterator(const NodeDefManager *ndef)
|
|
{
|
|
// Test some lines
|
|
// Do not test lines that start or end on the border of
|
|
// two voxels as rounding errors can make the test fail!
|
|
std::vector<core::line3d<f32> > lines;
|
|
for (f32 x = -9.1; x < 9; x += 3.124) {
|
|
for (f32 y = -9.2; y < 9; y += 3.123) {
|
|
for (f32 z = -9.3; z < 9; z += 3.122) {
|
|
lines.emplace_back(-x, -y, -z, x, y, z);
|
|
}
|
|
}
|
|
}
|
|
lines.emplace_back(0, 0, 0, 0, 0, 0);
|
|
// Test every line
|
|
std::vector<core::line3d<f32> >::iterator it = lines.begin();
|
|
for (; it < lines.end(); it++) {
|
|
core::line3d<f32> l = *it;
|
|
|
|
// Initialize test
|
|
voxalgo::VoxelLineIterator iterator(l.start, l.getVector());
|
|
|
|
//Test the first voxel
|
|
v3s16 start_voxel = floatToInt(l.start, 1);
|
|
UASSERT(iterator.m_current_node_pos == start_voxel);
|
|
|
|
// Values for testing
|
|
v3s16 end_voxel = floatToInt(l.end, 1);
|
|
v3s16 voxel_vector = end_voxel - start_voxel;
|
|
int nodecount = abs(voxel_vector.X) + abs(voxel_vector.Y)
|
|
+ abs(voxel_vector.Z);
|
|
int actual_nodecount = 0;
|
|
v3s16 old_voxel = iterator.m_current_node_pos;
|
|
|
|
while (iterator.hasNext()) {
|
|
iterator.next();
|
|
actual_nodecount++;
|
|
v3s16 new_voxel = iterator.m_current_node_pos;
|
|
// This must be a neighbor of the old voxel
|
|
UASSERTEQ(f32, (new_voxel - old_voxel).getLengthSQ(), 1);
|
|
// The line must intersect with the voxel
|
|
v3f voxel_center = intToFloat(iterator.m_current_node_pos, 1);
|
|
aabb3f box(voxel_center - v3f(0.5, 0.5, 0.5),
|
|
voxel_center + v3f(0.5, 0.5, 0.5));
|
|
UASSERT(box.intersectsWithLine(l));
|
|
// Update old voxel
|
|
old_voxel = new_voxel;
|
|
}
|
|
|
|
// Test last node
|
|
UASSERT(iterator.m_current_node_pos == end_voxel);
|
|
// Test node count
|
|
UASSERTEQ(int, actual_nodecount, nodecount);
|
|
}
|
|
}
|