diff options
| author | Thorbjørn Lindeijer <thorbjorn.lindeijer@nokia.com> | 2009-09-01 10:37:56 +0200 |
|---|---|---|
| committer | Thorbjørn Lindeijer <thorbjorn.lindeijer@nokia.com> | 2009-09-01 11:55:17 +0200 |
| commit | 150c14bc50d28d2e6c768ff00654f527cb226812 (patch) | |
| tree | dccb45f1edd46cdd6e987373a77940eebd53b24a /tests/auto/qpainterpath | |
| parent | 22ac5bb9aac73b0c7d319f2cdc42dd5bcd59f2b4 (diff) | |
Fixed QPainterPath::toFillPolygons autotest
Now it verifies that there are two non-intersecting polygons.
Reviewed-by: Gunnar Sletta <gunnar@trolltech.com>
Diffstat (limited to 'tests/auto/qpainterpath')
| -rw-r--r-- | tests/auto/qpainterpath/tst_qpainterpath.cpp | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/tests/auto/qpainterpath/tst_qpainterpath.cpp b/tests/auto/qpainterpath/tst_qpainterpath.cpp index 26c1f9b9da..9c4cbc47bf 100644 --- a/tests/auto/qpainterpath/tst_qpainterpath.cpp +++ b/tests/auto/qpainterpath/tst_qpainterpath.cpp @@ -1145,8 +1145,9 @@ void tst_QPainterPath::testToFillPolygons() path.lineTo(QPointF(70, 100)); path.lineTo(QPointF(40, 100)); - QPolygonF polygon = path.toFillPolygons(QMatrix()).first(); - QCOMPARE(polygon.count(QPointF(70, 50)), 2); + const QList<QPolygonF> polygons = path.toFillPolygons(); + QCOMPARE(polygons.size(), 2); + QCOMPARE(polygons.first().count(QPointF(70, 50)), 0); } void tst_QPainterPath::connectPathDuplicatePoint() |