This is a step towards #194. Using an unbounded revwalk that is topologically sorted is very expensive, once.
This removes most uses and speeds things up when there are no feature branches. With only master on gecko-dev, we went from ~25s to <1s. However, we still need to remove the last topoligical sort which is used for creating the commit graph, so generally people will not see a speed up yet.
However, we did improve the logic for picking protected bases as part of this.
This is a step towards #194. Using an unbounded revwalk that is topologically sorted is very expensive, once.
This removes most uses and speeds things up when there are no feature branches. With only
masterongecko-dev, we went from ~25s to <1s. However, we still need to remove the last topoligical sort which is used for creating the commit graph, so generally people will not see a speed up yet.However, we did improve the logic for picking protected bases as part of this.