diff options
| author | Christian Kandeler <christian.kandeler@digia.com> | 2014-07-31 16:35:47 +0200 |
|---|---|---|
| committer | Christian Kandeler <christian.kandeler@digia.com> | 2014-07-31 17:28:25 +0200 |
| commit | 3b4f5d6acae1338e8f188d02b6348b0c20727a16 (patch) | |
| tree | 291668123f58c18fa87bb095ea74b267b94af1a5 /src/lib/corelib/buildgraph/inputartifactscanner.cpp | |
| parent | db9a29f2c94fc47e0fe7bcac0142f48e2468c0da (diff) | |
Speed up artifact removal.
The current recursive algorithm for removing an artifact from the input
set of all rule nodes, while admittedly very l33t-looking, results in
a quasi-infinite loop when a larger number of artifacts are to be
removed. Instead, we now simply iterate over the list of nodes.
A further speed-up might be possible by doing batch changes, but this
one solves the immediate problem.
Change-Id: Id3c19321c82d5097e58b1b312c8717c59dc06eb3
Reviewed-by: Joerg Bornemann <joerg.bornemann@digia.com>
Diffstat (limited to 'src/lib/corelib/buildgraph/inputartifactscanner.cpp')
0 files changed, 0 insertions, 0 deletions