diff options
| author | Jan-Arve Sæther <jan-arve.saether@nokia.com> | 2009-06-11 13:25:05 (GMT) |
|---|---|---|
| committer | Eduardo M. Fleury <eduardo.fleury@openbossa.org> | 2009-07-22 18:04:29 (GMT) |
| commit | b7150b21f02435abb8f7a4d94b929ecdad2ef79b (patch) | |
| tree | 96e2e196680c6b44ea9a34f5f6ad216823ed8089 /doc/src/snippets/code/src_script_qscriptcontext.cpp | |
| parent | a41ac791921329c33947a0748d76683868a9bbf6 (diff) | |
| download | Qt-b7150b21f02435abb8f7a4d94b929ecdad2ef79b.zip Qt-b7150b21f02435abb8f7a4d94b929ecdad2ef79b.tar.gz Qt-b7150b21f02435abb8f7a4d94b929ecdad2ef79b.tar.bz2 | |
Simplify the code that finds the sequential chunks for simplification.
If two vertices are adjacent in the candidate list they should also be
adjacent in the graph. This means there should always be an edge
between candidates.at(n) and candidates.at(n + 1).
Diffstat (limited to 'doc/src/snippets/code/src_script_qscriptcontext.cpp')
0 files changed, 0 insertions, 0 deletions