| commit | 9f237f42f94a205ba2d0da81efaf5cd411f38a27 | [log] [tgz] |
|---|---|---|
| author | Daniel Norman <danielnorman@google.com> | Mon Feb 10 18:14:42 2020 +0000 |
| committer | Gerrit Code Review <noreply-gerritcodereview@google.com> | Mon Feb 10 18:14:42 2020 +0000 |
| tree | 7f83b7aa013a871f7d198e008de77940036e4ca1 | |
| parent | 196753fedd343fcf5543313f2453134b2cda5acc [diff] | |
| parent | dac01dadceaa9a1d28437419cfa077c2f9d6c11f [diff] |
Merge "Scans repo projects by longest path match first, rather than shortest."
diff --git a/split/manifest_split.py b/split/manifest_split.py index a5edb30..3e4698e 100644 --- a/split/manifest_split.py +++ b/split/manifest_split.py
@@ -185,7 +185,7 @@ """ parts = input_path.split("/") - for index in range(0, len(parts)): + for index in reversed(range(0, len(parts))): project_path = os.path.join(*parts[:index + 1]) if project_path in repo_projects: return project_path