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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <cppunit/TestAssert.h>
#include <cppunit/TestFixture.h>
#include <cppunit/extensions/HelperMacros.h>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/polygon/b2dtrapezoid.hxx>
#include <random>
namespace basegfx
{
class b2dpolypolygon : public CppUnit::TestFixture
{
public:
// insert your test code here.
void testTrapezoidHelper()
{
B2DPolygon aPolygon;
// provoke the PointBlockAllocator to exercise the freeIfLast path
for (int i = 0; i < 16 * 10; i++)
{
B2DPoint aPoint(getRandomOrdinal(1000), getRandomOrdinal(1000));
aPolygon.append(aPoint);
}
// scatter some duplicate points in to stress things more.
for (int i = 0; i < 16 * 10; i++)
{
aPolygon.insert(getRandomOrdinal(aPolygon.count() - 1),
aPolygon.getB2DPoint(getRandomOrdinal(aPolygon.count() - 1)));
}
B2DPolygon aPolygonOffset;
// duplicate the polygon and offset it slightly.
for (size_t i = 0; i < aPolygon.count(); i++)
{
B2DPoint aPoint(aPolygon.getB2DPoint(i));
aPoint += B2DPoint(0.5 - getRandomOrdinal(1), 0.5 - getRandomOrdinal(1));
aPolygonOffset.append(aPoint);
}
B2DPolyPolygon aPolyPolygon;
aPolyPolygon.append(aPolygon);
aPolyPolygon.append(aPolygonOffset);
B2DTrapezoidVector aVector;
basegfx::utils::trapezoidSubdivide(aVector, aPolyPolygon);
CPPUNIT_ASSERT_MESSAGE("more than zero sub-divided trapezoids", !aVector.empty());
}
std::mt19937 rng; // Standard mersenne_twister_engine
/// Gets a random ordinal [0,n)
::std::size_t getRandomOrdinal(const ::std::size_t n)
{
std::uniform_int_distribution<size_t> dist(0, n - 1);
return dist(rng);
}
// Change the following lines only, if you add, remove or rename
// member functions of the current class,
// because these macros are need by auto register mechanism.
CPPUNIT_TEST_SUITE(b2dpolypolygon);
CPPUNIT_TEST(testTrapezoidHelper);
CPPUNIT_TEST_SUITE_END();
}; // class b2dpolypolygon
} // namespace basegfx
CPPUNIT_TEST_SUITE_REGISTRATION(basegfx::b2dpolypolygon);
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
