compute fast-forward diffs much more efficiently#5989
Merged
Conversation
aryairani
approved these changes
Nov 10, 2025
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Overview
This PR swaps out the naive implementation of
diff.branch foo barwhenfooandbareither don't share a history at all (in which case we treatfooas the LCA), or when the LCA is eitherfooorbar(a fast-forward).Previously, we'd simply not bother to compare the LCA causal to either branch, and proceed to do a lot of unnecessary work in the case that it matches one of them. Now, we are careful to avoid any duplicate work (loading definitions, computing syntactic hashes, etc).
Test coverage
There's an existing transcript for this feature. I also tested manually at the command line.