| commit | dae7dc3fbabb7db41b870043c9f4b037c0dc55bb | [log] [tgz] |
|---|---|---|
| author | Philip Langer <planger@eclipsesource.com> | Thu May 11 14:49:42 2017 +0200 |
| committer | Philip Langer <planger@eclipsesource.com> | Tue May 23 13:05:38 2017 -0400 |
| tree | 9e33b025efa4a704a0178b08a4ed25a217633d87 | |
| parent | 70cf0e1afebf7a2d1b5bcec177cf17eedfe096c6 [diff] |
[516494] Avoid unnecessary traversals in resolution algorithm It can be improved by computing bounds as it traverses the dependency graph. In general, once we know we're going to visit a given URI or have already visited it, we don't need to visit its graph repeatedly when calculating subsequent dependencies. Bug: 516494 Change-Id: I10ca0c394210270fba01418127379191ecdbddfd Signed-off-by: Philip Langer <planger@eclipsesource.com>