summaryrefslogtreecommitdiffstats
path: root/tests
diff options
context:
space:
mode:
authorCaio Marcelo de Oliveira Filho <caio.oliveira@openbossa.org>2009-11-04 22:48:54 (GMT)
committerCaio Marcelo de Oliveira Filho <caio.oliveira@openbossa.org>2009-11-06 18:17:53 (GMT)
commit2906522845d3ce9723b978b8b1490dfc9b9008f0 (patch)
tree20a6e91754fa542e9dcf041cc1a4b945ccf227ff /tests
parent92b51d119325adc7cef518c1260c71904fc68c40 (diff)
downloadQt-2906522845d3ce9723b978b8b1490dfc9b9008f0.zip
Qt-2906522845d3ce9723b978b8b1490dfc9b9008f0.tar.gz
Qt-2906522845d3ce9723b978b8b1490dfc9b9008f0.tar.bz2
QGAL: fix leak when restoring anchors
The restore algorithm had a leak, so we did not delete all the sequences and parallel anchors that were not part of the simplified graph, i.e. that were nested inside other anchors. This commit fix the leak and clean the restore function a little bit, so the recursive function is called even for Normal anchors (which are dealt accordingly). Note that the before/after information is exactly the ->from/->to information available in the anchor being looked on. Also added an assertion to document the fact that at this point (restoring anchor simplification), one of the two anchors inside a parallel anchor must be a sequence. The algorithm depends on that because you can't have two anchors with the same start and end points. Signed-off-by: Caio Marcelo de Oliveira Filho <caio.oliveira@openbossa.org> Reviewed-by: Eduardo M. Fleury <eduardo.fleury@openbossa.org>
Diffstat (limited to 'tests')
0 files changed, 0 insertions, 0 deletions