Change Details

As dulwich's client.fetch_pack expects an instance of history graph walker, and we don't know the list of heads already available locally until `determine_wants` has run, just implement the two methods (`__next__` and `ack`) that the graph walker expects in our RepoRepresentation class. Our previous code would always initialize the graph walker with an empty set of heads (as the `graph_walker()` method is called before `determine_wants()` has run, so `self.heads` is always empty), so we would never actually fetch an incremental pack file.

Eagerly populate the set of local heads in RepoRepresentation.__init__ As dulwich's client.fetch_pack expects an instance of history graph walker with set of known heads, move the local heads caching from `determine_wants` to the RepoRepresentation initialization logic. Our previous code would always initialize the graph walker with an empty set of heads (as the `graph_walker()` method is called before `determine_wants()` has run, so `self.heads` was always empty), so we would never actually fetch an incremental pack file.

As dulwich's client.fetch_pack expects an instance of history graphEagerly populate the set of local heads in RepoRepresentation.__init__ walker, and we don't know the list of heads already available locally As dulwich's client.fetch_pack expects an instance of history graph until `determine_wants` has runwalker with set of known heads, just implement the twomove the local heads caching from methods (`__next__` and `ack`) that the graph walker expects in our`determine_wants` to the RepoRepresentation initialization logic. RepoRepresentation class. Our previous code would always initialize the graph walker with an empty set of heads (as the `graph_walker()` method is called before `determine_wants()` has run, so `self.heads` iwas always empty), so we would never actually fetch an incremental pack file.