1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
//Copyright (c) 2020 Ultimaker B.V.
//CuraEngine is released under the terms of the AGPLv3 or higher.
#include <gtest/gtest.h> //To run the tests.
#include "../src/PathOrderOptimizer.h" //The code under test.
namespace cura
{
class PathOrderOptimizerTest : public testing::Test
{
public:
/*!
* A blank optimizer with no polygons added yet. Fresh and virgin.
*/
PathOrderOptimizer<ConstPolygonPointer> optimizer;
/*!
* A simple isosceles triangle. Base length and height 50.
*/
Polygon triangle;
PathOrderOptimizerTest() : optimizer(Point(0, 0)) {}
void SetUp()
{
optimizer = PathOrderOptimizer<ConstPolygonPointer>(Point(0, 0));
triangle.clear();
triangle.add(Point(0, 0));
triangle.add(Point(50, 0));
triangle.add(Point(25, 50));
}
};
/*!
* Test optimizing an empty set of paths.
*/
TEST_F(PathOrderOptimizerTest, OptimizeWhileEmpty)
{
optimizer.optimize(); //Don't crash.
EXPECT_EQ(optimizer.paths.size(), 0) << "Still empty!";
}
/*!
* Tests traversing three triangles, positioned in a line. The order of
* traversal should be very clear, from close to the origin to far.
*/
TEST_F(PathOrderOptimizerTest, ThreeTrianglesShortestOrder)
{
Polygon near = triangle; //Copy, then translate.
near.translate(Point(100, 100));
Polygon middle = triangle;
middle.translate(Point(500, 500));
Polygon far = triangle;
far.translate(Point(1000, 1000));
//Add them out of order so that it's clear that the optimization changes the order.
optimizer.addPolygon(middle);
optimizer.addPolygon(far);
optimizer.addPolygon(near);
optimizer.optimize();
EXPECT_EQ(optimizer.paths[0].vertices->front(), Point(100, 100)) << "Nearest triangle first.";
EXPECT_EQ(optimizer.paths[1].vertices->front(), Point(500, 500)) << "Middle triangle second.";
EXPECT_EQ(optimizer.paths[2].vertices->front(), Point(1000, 1000)) << "Far triangle last.";
}
}
|
