/**************************************************************************** ** ** Copyright (C) 2016 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the test suite of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:GPL-EXCEPT$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and The Qt Company. For licensing terms ** and conditions see https://www.qt.io/terms-conditions. For further ** information use the contact form at https://www.qt.io/contact-us. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 3 as published by the Free Software ** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT ** included in the packaging of this file. Please review the following ** information to ensure the GNU General Public License requirements will ** be met: https://www.gnu.org/licenses/gpl-3.0.html. ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #include #include #include #include #include class tst_QPolygon : public QObject { Q_OBJECT public: tst_QPolygon(); private slots: void boundingRect_data(); void boundingRect(); void boundingRectF_data(); void boundingRectF(); void makeEllipse(); void swap(); }; tst_QPolygon::tst_QPolygon() { } void tst_QPolygon::boundingRect_data() { QTest::addColumn("poly"); QTest::addColumn("brect"); #define ROW(args, rect) \ do { \ QPolygon poly; \ poly.setPoints args; \ QTest::newRow(#args) << poly << QRect rect; \ } while (0) QTest::newRow("empty") << QPolygon() << QRect(0, 0, 0, 0); ROW((1, 0,1), ( 0, 1, 1, 1)); ROW((2, 0,1, 1,0), ( 0, 0, 2, 2)); ROW((3, -1,1, -1,-1, 1,0), (-1,-1, 3, 3)); #undef ROW } void tst_QPolygon::boundingRect() { QFETCH(QPolygon, poly); QFETCH(QRect, brect); QCOMPARE(poly.boundingRect(), brect); } namespace { struct MyPolygonF : QPolygonF { // QPolygonF doesn't have setPoints... void setPoints(int nPoints, int firstx, int firsty, ...) { va_list ap; reserve(nPoints); *this << QPointF(firstx, firsty); va_start(ap, firsty); while (--nPoints) { const int x = va_arg(ap, int); const int y = va_arg(ap, int); *this << QPointF(x, y); } va_end(ap); } }; } void tst_QPolygon::boundingRectF_data() { QTest::addColumn("poly"); QTest::addColumn("brect"); #define ROW(args, rect) \ do { \ MyPolygonF poly; \ poly.setPoints args; \ QTest::newRow(#args) << QPolygonF(poly) << QRectF rect; \ } while (0) QTest::newRow("empty") << QPolygonF() << QRectF(0, 0, 0, 0); ROW((1, 0,1), ( 0, 1, 0, 0)); ROW((2, 0,1, 1,0), ( 0, 0, 1, 1)); ROW((3, -1,1, -1,-1, 1,0), (-1,-1, 2, 2)); #undef ROW } void tst_QPolygon::boundingRectF() { QFETCH(QPolygonF, poly); QFETCH(QRectF, brect); QCOMPARE(poly.boundingRect(), brect); } void tst_QPolygon::makeEllipse() { // create an ellipse with R1 = R2 = R, i.e. a circle QPolygon pa; const int R = 50; // radius QPainterPath path; path.addEllipse(0, 0, 2*R, 2*R); pa = path.toSubpathPolygons().at(0).toPolygon(); int i; // make sure that all points are R+-1 away from the center bool err = false; for (i = 1; i < pa.size(); i++) { QPoint p = pa.at(i); double r = sqrt(pow(double(p.x() - R), 2.0) + pow(double(p.y() - R), 2.0)); // ### too strict ? at least from visual inspection it looks // quite odd around the main axes. 2.0 passes easily. err |= (qAbs(r - double(R)) > 2.0); } QVERIFY( !err ); } void tst_QPolygon::swap() { QPolygon p1(QVector() << QPoint(0,0) << QPoint(10,10) << QPoint(-10,10)); QPolygon p2(QVector() << QPoint(0,0) << QPoint( 0,10) << QPoint( 10,10) << QPoint(10,0)); p1.swap(p2); QCOMPARE(p1.count(),4); QCOMPARE(p2.count(),3); } QTEST_APPLESS_MAIN(tst_QPolygon) #include "tst_qpolygon.moc"