mirror/aseprite
1
0
Fork 0
mirror of https://github.com/aseprite/aseprite.git synced 2025-02-21 21:41:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add polygon tests

Browse Source
This commit is contained in:
Gaspar Capello 2019-06-03 14:28:46 -03:00 committed by David Capello
parent 8ae289d7e6
commit 81a355133d
2 changed files with 446 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/CMakeLists.txt
View File

@ -209,6 +209,7 @@ if(ENABLE_TESTS)
find_tests(app/file app-lib) find_tests(app/file app-lib)
find_tests(app app-lib) find_tests(app app-lib)
find_tests(. app-lib) find_tests(. app-lib)
find_tests(doc/algorithm doc-lib)
endif() endif()
if(ENABLE_BENCHMARKS) if(ENABLE_BENCHMARKS)

445
src/doc/algorithm/polygon_tests.cpp Normal file
View File

@ -0,0 +1,445 @@
// Aseprite Document Library
// Copyright (c) 2019 Igara Studio S.A.
//
// This file is released under the terms of the MIT license.
// Read LICENSE.txt for more information.
#include "gtest/gtest.h"
#include "doc/algorithm/polygon.h"
struct scanSegment {
int x1;
int x2;
int y;
scanSegment(int x1, int y, int x2) :
x1(x1),
x2(x2),
y(y)
{}
};
struct ScanLineResult {
std::vector<scanSegment> scanLines;
};
void captureHscanSegment (int x1, int y, int x2, void* scanDataResults) {
ScanLineResult* results = (ScanLineResult*) scanDataResults;
results->scanLines.push_back(scanSegment(x1, y, x2));
}
TEST(Polygon, HorizontalLine1Test)
{
// P0-----P1
int points[4] = { 0 , 0 ,
2 , 0
};
int n = 2;
ScanLineResult results;
doc::algorithm::polygon(n, &points[0], &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 1);
if (results.scanLines.size() == 1) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 2);
EXPECT_EQ(results.scanLines[0].y, 0);
}
}
TEST(Polygon, HorizontalLine2Test)
{
// P0-----P2-----P1
int points[6] = { 0 , 0 ,
2 , 0 ,
5 , 0
};
int n = 3;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 1);
if (results.scanLines.size() == 1) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 5);
EXPECT_EQ(results.scanLines[0].y, 0);
}
}
TEST(Polygon, VerticalLine1Test)
{
// P0
// |
// |
// P1
int points[4] = { 0 , 0 ,
0 , 2 ,
};
int n = 2;
ScanLineResult results;
doc::algorithm::polygon(n, &points[0], &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 3);
if (results.scanLines.size() == 3) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 0);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 0);
EXPECT_EQ(results.scanLines[1].x2, 0);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 0);
EXPECT_EQ(results.scanLines[2].x2, 0);
EXPECT_EQ(results.scanLines[2].y, 2);
}
}
TEST(Polygon, VerticalLine2Test)
{
// P0
// |
// |
// P2
// |
// |
// P1
int points[6] = { 0 , 0 ,
0 , 2 ,
0 , 5 ,
};
int n = 3;
ScanLineResult results;
doc::algorithm::polygon(n, points, &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 6);
if (results.scanLines.size() == 6) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 0);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 0);
EXPECT_EQ(results.scanLines[1].x2, 0);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 0);
EXPECT_EQ(results.scanLines[2].x2, 0);
EXPECT_EQ(results.scanLines[2].y, 2);
EXPECT_EQ(results.scanLines[3].x1, 0);
EXPECT_EQ(results.scanLines[3].x2, 0);
EXPECT_EQ(results.scanLines[3].y, 3);
EXPECT_EQ(results.scanLines[4].x1, 0);
EXPECT_EQ(results.scanLines[4].x2, 0);
EXPECT_EQ(results.scanLines[4].y, 4);
EXPECT_EQ(results.scanLines[5].x1, 0);
EXPECT_EQ(results.scanLines[5].x2, 0);
EXPECT_EQ(results.scanLines[5].y, 5);
}
}
TEST(Polygon, Triangle1Test)
{
// P0-----P2
// | /
// | /
// | /
// | /
// | /
// P1
int points[6] = { 0 , 0 ,
0 , 2 ,
2 , 0 ,
};
int n = 3;
ScanLineResult results;
doc::algorithm::polygon(n, points, &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 3);
if (results.scanLines.size() == 3) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 2);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 0);
EXPECT_EQ(results.scanLines[1].x2, 1);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 0);
EXPECT_EQ(results.scanLines[2].x2, 0);
EXPECT_EQ(results.scanLines[2].y, 2);
}
}
TEST(Polygon, Triangle2Test)
{
// P1
// / \
// / \
// / \
// P0-----P2
int points[6] = { 0 , 4 ,
2 , 0 ,
4 , 4 ,
};
int n = 3;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 5);
if (results.scanLines.size() == 5) {
EXPECT_EQ(results.scanLines[0].x1, 2);
EXPECT_EQ(results.scanLines[0].x2, 2);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 2);
EXPECT_EQ(results.scanLines[1].x2, 3);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 1);
EXPECT_EQ(results.scanLines[2].x2, 3);
EXPECT_EQ(results.scanLines[2].y, 2);
EXPECT_EQ(results.scanLines[3].x1, 1);
EXPECT_EQ(results.scanLines[3].x2, 4);
EXPECT_EQ(results.scanLines[3].y, 3);
EXPECT_EQ(results.scanLines[4].x1, 0);
EXPECT_EQ(results.scanLines[4].x2, 4);
EXPECT_EQ(results.scanLines[4].y, 4);
}
}
TEST(Polygon, Triangle3Test)
{
// P2
// / \
// / \
// / \
// P0-----P1
int points[6] = { 0 , 4 ,
4 , 4 ,
2 , 0 ,
};
int n = 3;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 5);
if (results.scanLines.size() == 5) {
EXPECT_EQ(results.scanLines[0].x1, 2);
EXPECT_EQ(results.scanLines[0].x2, 2);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 1);
EXPECT_EQ(results.scanLines[1].x2, 2);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 1);
EXPECT_EQ(results.scanLines[2].x2, 3);
EXPECT_EQ(results.scanLines[2].y, 2);
EXPECT_EQ(results.scanLines[3].x1, 0);
EXPECT_EQ(results.scanLines[3].x2, 3);
EXPECT_EQ(results.scanLines[3].y, 3);
EXPECT_EQ(results.scanLines[4].x1, 0);
EXPECT_EQ(results.scanLines[4].x2, 4);
EXPECT_EQ(results.scanLines[4].y, 4);
}
}
TEST(Polygon, Triangle4Test)
{
// P2
// / \
// / \
// / \
// P1-----P0
int points[6] = { 4 , 4 ,
0 , 4 ,
2 , 0 ,
};
int n = 3;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 5);
if (results.scanLines.size() == 5) {
EXPECT_EQ(results.scanLines[0].x1, 2);
EXPECT_EQ(results.scanLines[0].x2, 2);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 2);
EXPECT_EQ(results.scanLines[1].x2, 3);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 1);
EXPECT_EQ(results.scanLines[2].x2, 3);
EXPECT_EQ(results.scanLines[2].y, 2);
EXPECT_EQ(results.scanLines[3].x1, 1);
EXPECT_EQ(results.scanLines[3].x2, 4);
EXPECT_EQ(results.scanLines[3].y, 3);
EXPECT_EQ(results.scanLines[4].x1, 0);
EXPECT_EQ(results.scanLines[4].x2, 4);
EXPECT_EQ(results.scanLines[4].y, 4);
}
}
TEST(Polygon, Square1Test)
{
// P0-----P2
// | |
// | |
// | |
// P1-----P2
int points[8] = { 0 , 0 ,
0 , 2 ,
2 , 2 ,
2 , 0
};
int n = 4;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 3);
if (results.scanLines.size() == 3) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 2);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 0);
EXPECT_EQ(results.scanLines[1].x2, 2);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 0);
EXPECT_EQ(results.scanLines[2].x2, 2);
EXPECT_EQ(results.scanLines[2].y, 2);
}
}
TEST(Polygon, Poligon1Test)
{
// P0 P2
// \ / /
// \ P3 /
// \ /
// P1
int points[8] = { 0 , 0 ,
2 , 3 ,
4 , 0 ,
2 , 1
};
int n = 4;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 5);
if (results.scanLines.size() == 5) {
EXPECT_EQ(results.scanLines[0].x1, 0);
EXPECT_EQ(results.scanLines[0].x2, 1);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 4);
EXPECT_EQ(results.scanLines[1].x2, 4);
EXPECT_EQ(results.scanLines[1].y, 0);
EXPECT_EQ(results.scanLines[2].x1, 1);
EXPECT_EQ(results.scanLines[2].x2, 3);
EXPECT_EQ(results.scanLines[2].y, 1);
EXPECT_EQ(results.scanLines[3].x1, 1);
EXPECT_EQ(results.scanLines[3].x2, 3);
EXPECT_EQ(results.scanLines[3].y, 2);
EXPECT_EQ(results.scanLines[4].x1, 2);
EXPECT_EQ(results.scanLines[4].x2, 2);
EXPECT_EQ(results.scanLines[4].y, 3);
}
}
TEST(Polygon, Polygon2Test)
{
// P3------P4
// P0 | /
// \ | /
// \ | /
// \ / P2 P5
// P1 / \
// \
// P9 /P7 \
// \ / \ \
// P8 \ P6
int points[20] = { 0 , 1 ,
2 , 4 ,
4 , 3 ,
4 , 0 ,
7 , 0 ,
6 , 3 ,
9 , 7 ,
5 , 5 ,
3 , 7 ,
2 , 5
};
int n = 10;
ScanLineResult results;
doc::algorithm::polygon(n, points, (void *) &results, captureHscanSegment);
EXPECT_EQ(results.scanLines.size(), 13);
if (results.scanLines.size() == 13) {
EXPECT_EQ(results.scanLines[0].x1, 4);
EXPECT_EQ(results.scanLines[0].x2, 7);
EXPECT_EQ(results.scanLines[0].y, 0);
EXPECT_EQ(results.scanLines[1].x1, 0);
EXPECT_EQ(results.scanLines[1].x2, 0);
EXPECT_EQ(results.scanLines[1].y, 1);
EXPECT_EQ(results.scanLines[2].x1, 4);
EXPECT_EQ(results.scanLines[2].x2, 7);
EXPECT_EQ(results.scanLines[2].y, 1);
EXPECT_EQ(results.scanLines[3].x1, 0);
EXPECT_EQ(results.scanLines[3].x2, 1);
EXPECT_EQ(results.scanLines[3].y, 2);
EXPECT_EQ(results.scanLines[4].x1, 4);
EXPECT_EQ(results.scanLines[4].x2, 6);
EXPECT_EQ(results.scanLines[4].y, 2);
EXPECT_EQ(results.scanLines[5].x1, 1);
EXPECT_EQ(results.scanLines[5].x2, 1);
EXPECT_EQ(results.scanLines[5].y, 3);
EXPECT_EQ(results.scanLines[6].x1, 3);
EXPECT_EQ(results.scanLines[6].x2, 6);
EXPECT_EQ(results.scanLines[6].y, 3);
EXPECT_EQ(results.scanLines[7].x1, 1);
EXPECT_EQ(results.scanLines[7].x2, 7);
EXPECT_EQ(results.scanLines[7].y, 4);
EXPECT_EQ(results.scanLines[8].x1, 2);
EXPECT_EQ(results.scanLines[8].x2, 8);
EXPECT_EQ(results.scanLines[8].y, 5);
EXPECT_EQ(results.scanLines[9].x1, 2);
EXPECT_EQ(results.scanLines[9].x2, 4);
EXPECT_EQ(results.scanLines[9].y, 6);
EXPECT_EQ(results.scanLines[10].x1, 7);
EXPECT_EQ(results.scanLines[10].x2, 8);
EXPECT_EQ(results.scanLines[10].y, 6);
EXPECT_EQ(results.scanLines[11].x1, 3);
EXPECT_EQ(results.scanLines[11].x2, 3);
EXPECT_EQ(results.scanLines[11].y, 7);
EXPECT_EQ(results.scanLines[12].x1, 9);
EXPECT_EQ(results.scanLines[12].x2, 9);
EXPECT_EQ(results.scanLines[12].y, 7);
}
}
int main(int argc, char** argv)
{
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}