565
565
# Looking up keys in batches of 1000 can cut the time in half, as well as
566
566
# memory consumption. GraphIndex *does* like to look for a few keys in
567
567
# parallel, it just doesn't like looking for *lots* of keys in parallel.
568
572
get_parent_map = branch.repository.texts.get_parent_map
569
573
modified_text_revisions = set()