stupid: only check branch mappings for discovered files once For whatever reason, we were processing the list of discovered files for new branches every time we discovered a new file. This pulls the process-discovered-files loop out of the discover-files loop, and should reduce the running time from O(num_paths_discovered * num_files_discovered) to O(num_paths_discovered + num_files_discovered)