diff options
author | Caio Marcelo de Oliveira Filho <caio.oliveira@openbossa.org> | 2009-08-17 15:26:16 (GMT) |
---|---|---|
committer | Caio Marcelo de Oliveira Filho <caio.oliveira@openbossa.org> | 2009-08-17 16:59:06 (GMT) |
commit | 47ee590221f70f16bb27bf20f858dc60c9fc14ca (patch) | |
tree | 3c3d71a2fd100c4de691b2af008b7ffed05f6024 /tests/auto/qgraphicsanchorlayout | |
parent | a9457f0a626a306b4ac7e3ab6a6a89a92f724fa6 (diff) | |
download | Qt-47ee590221f70f16bb27bf20f858dc60c9fc14ca.zip Qt-47ee590221f70f16bb27bf20f858dc60c9fc14ca.tar.gz Qt-47ee590221f70f16bb27bf20f858dc60c9fc14ca.tar.bz2 |
QGraphicsAnchorLayout: calculate vertex positions with simplified graph
When traversing the graph looking for calculating the distances, also
enter inside the complex edges to find (and calculate) the distances for
the vertices that were simplified.
This require a little tweak in the traversal, now we can't always skip an edge
when both vertices are already visited, because complex anchors can hide
vertices inside (a sequential anchor in practice remove vertices from the
full graph).
As a bonus we now pass on the 'example' test (as expected) and the
example now works fine.
Signed-off-by: Caio Marcelo de Oliveira Filho <caio.oliveira@openbossa.org>
Diffstat (limited to 'tests/auto/qgraphicsanchorlayout')
-rw-r--r-- | tests/auto/qgraphicsanchorlayout/tst_qgraphicsanchorlayout.cpp | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/tests/auto/qgraphicsanchorlayout/tst_qgraphicsanchorlayout.cpp b/tests/auto/qgraphicsanchorlayout/tst_qgraphicsanchorlayout.cpp index 57f04cc..e663f40 100644 --- a/tests/auto/qgraphicsanchorlayout/tst_qgraphicsanchorlayout.cpp +++ b/tests/auto/qgraphicsanchorlayout/tst_qgraphicsanchorlayout.cpp @@ -682,7 +682,6 @@ void tst_QGraphicsAnchorLayout::example() QCOMPARE(p.size(), layoutMinimumSize); QCOMPARE(a->size(), e->size()); QCOMPARE(b->size(), d->size()); - QEXPECT_FAIL("", "please fix this test", Abort); QCOMPARE(f->size(), g->size()); p.resize(layoutPreferredSize); |